Hello,
Sage does elimination when calling Polyhedron
sage: ieqs = [[-1,1,0],[-1,0,1],[-2,1,1],[-3,2,1],[-2,2,1]]
sage: P = Polyhedron(ieqs=ieqs)
sage: P.inequalities()
(An inequality (0, 1) x - 1 >= 0, An inequality (1, 0) x - 1 >= 0)
I do not know how to use lrs. It is currently use in Sage only to
compute the volume (and the way it is used is quite broken as far as I
can see).
Vincent
On 17/04/15 18:52, Anirudh Krishna wrote:
I have a matrix which represents the inequalities of a polyhedron. Many of
these inequalities are redundant. Currently, I use the PPL polyhedron
package which is the default package in SAGE for working with Polyhedra.
Unfortunately, this is really slow. Suppose A is the matrix that represents
these inequalities, my code is as follows
C = FM eliminate(A,1)
M = Polyhedron(ieqs = C)
I know that LRS has a function called redund for removing redundant
inequalities. How do I call it from SAGE?
I have installed LRS via "sage -i lrs".
Thanks.
I wrote the FM eliminate function myself. [I'd also like to complain about
this: Why doesn't the default polyhedron package come equipped with FM
elimination?? Perhaps I should start a separate thread.]
--
You received this message because you are subscribed to the Google Groups
"sage-support" 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-support.
For more options, visit https://groups.google.com/d/optout.
