I don't know any algorithmic way to solve arbitrary polynomial
inequalities. But e.g. for fixed integers i,j,k you get only linear
constraints in the remaining variables.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-s
Looking at the polyhedral computation documentation, I don't think it
does non-linear equations--is there another way of doing that in Sage?
Cal
On Dec 5, 1:45 pm, Volker Braun wrote:
> I don't think maxima does polyhedral computations in its assume facility,
> so you probably get the wrong answ
That would explain why it wasn't working. I've never done polyhedral
computations before, but I will look at your example and the reference
manual and see what I can do!
Thank you!
On Dec 5, 1:45 pm, Volker Braun wrote:
> I don't think maxima does polyhedral computations in its assume facility,
I don't think maxima does polyhedral computations in its assume facility,
so you probably get the wrong answer.
We do, however, have quite a lot of tools for polyhedral computations:
sage: P = Polyhedron(ieqs=[(1,2), (10,-7)])
sage: P
A 1-dimensional polyhedron in QQ^1 defined as the convex hull
