#14238: a polyhedron() method for Linear Programs
--------------------------------------+-------------------------------------
Reporter: ncohen | Owner: ncohen
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-5.9
Component: linear programming | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Nathann Cohen | Merged in:
Dependencies: | Stopgaps:
--------------------------------------+-------------------------------------
Comment (by dimpase):
Replying to [comment:3 ncohen]:
> > * the original polyhedron described by the input
> > * the way it is represented by the backend invoked.
>
> I don't see what you have in mind. The LP variables are internally
numbered from 0 to n-1, that is also the case with the variables of a
Polyhedron. With this, there is only ony way to define the constraints,
isn't it ?
actually, you yourself pointed out to me, a while ago, a case where a
backend (GUROBI?) does some nontrivial rewriting of a constraint, if I
recall right, of the form a<=x_i<=b, resulting in adding a new variable,
or something like this.
Dima
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14238#comment:4>
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 http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
