#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 dimpase):
Replying to [comment:1 novoselt]:
> I've actually have a module that does construct duals, but it is a "from
scratch" implementation of linear programs and simplex method steps for
educational reasons. It is not yet ready for inclusion in Sage, but I am
likely to teach linear optimization this fall and plan to post it for
review by the end of the term or earlier.
I hope it will be a solver backend rather than feature a yet another way
to enter linear equations and inequalities into Sage.
IMHO we need to initiate a major cleanup of these, as PPL backend, MILP
backends, CVXOPT, and perhaps other places I am not aware of or don't
recall each have its own way of accomplishing this task. And this
certainly sucks from the userland point of view.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13141#comment:2>
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.
