#13141: implement constructing the dual of a linear program
-------------------------------------+-------------------------------------
Reporter: dimpase | Owner: ncohen
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-
Component: linear | duplicate/invalid/wontfix
programming | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by mkoeppe):
* status: new => needs_review
* milestone: sage-6.4 => sage-duplicate/invalid/wontfix
Comment:
I think this is a dup of #7290. And I think explicitly constructing dual
LPs from a given LP is something that one wouldn't do with a solver.
Rather set solver parameters that explicit request the primal or dual
simplex method, when available.
#7290, #18733, #18804 give access to dual information in various form.
Explicitly dualizing is already available for the textbook implementation
of the simplex method, `InteractiveLPProblem`.
That's why I'm marking this as "duplicate"
--
Ticket URL: <http://trac.sagemath.org/ticket/13141#comment:8>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
