New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
a polyhedron() method for Linear Programs #14238
Comments
comment:2
I can think of two not always equal things this returns
Please clarify in the docs. Also, please add tests for unbounded and empty cases... |
comment:3
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 ? Nathann |
comment:4
Replying to @nathanncohen:
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 |
comment:5
Arggggggggg... Right. I had totally forgotten about that. I will add a warning. I hate these hacks Nathann |
comment:6
Done ! Thanks for noticing that ! Nathann |
comment:8
The patch needs a proper commit message. |
Reviewer: Dmitrii Pasechnik |
comment:9
Attachment: trac_14238.patch.gz |
Merged: sage-5.9.beta0 |
As the title says, this patch implements a
.polyhedron()
method which returns thePolyhedron
object defined by the LP.And some doc, while we are at it.
Nathann
CC: @dimpase @dcoudert @nthiery @vbraun
Component: linear programming
Author: Nathann Cohen
Reviewer: Dmitrii Pasechnik
Merged: sage-5.9.beta0
Issue created by migration from https://trac.sagemath.org/ticket/14238
The text was updated successfully, but these errors were encountered: