#13141: implement constructing the dual of a linear program
--------------------------------------+-------------------------------------
Reporter: dimpase | Owner: ncohen
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.2
Component: linear programming | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
--------------------------------------+-------------------------------------
Comment (by novoselt):
It cannot be a solver back-end: the point is not to have another algorithm
of solving LPs, but to allow students using simplex method step-by-step
without worrying about arithmetic. I also made the output match the
lecture notes which we were using, and input is done by matrices/vectors.
The standard way of constructing linear programs in Sage is, IMHO,
extremely confusing for beginners.
One of the first versions of the module was published here:
http://www.sagenb.org/home/pub/3318/
most of the math is now screwed up, which is quite unfortunate and
annoying, but it is still more or less clear what it does. Later versions
also support "revised dictionaries" and plots for graphical solving in 2D,
e.g. this exam solutions were generated by it via SageTeX:
http://www.math.ualberta.ca/~novoseltsev/2011Fall373A1/final_solutions.pdf
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13141#comment:3>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
