You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Now that MultivariatePolynomials is lightweight thanks to JuliaAlgebra/MultivariatePolynomials.jl#41, we could add it to the requirement of Polyhedra and makes the HRepresentation and Polyhedron types BasicSemialgebraicSet subtypes.
We could define a Polyhedra.Variable type with a Polyhedra.@polyvar macro and an AffineTerm and an AffinePolynomial types.
This way, one could define an HRepresentation with
@polyvar x y
@set x + y == 1 && x >= 0 && y >= 0
The inequalities and equalities iterators would return AffinePolynomials. @rdeits what do you think ?
The text was updated successfully, but these errors were encountered:
I don't think it would help with Newton polytopes, it just gives a nice interface to build polytopes similar to SemialgebraicSets, I don't think it is a high priority.
Now that MultivariatePolynomials is lightweight thanks to JuliaAlgebra/MultivariatePolynomials.jl#41, we could add it to the requirement of Polyhedra and makes the
HRepresentation
andPolyhedron
typesBasicSemialgebraicSet
subtypes.We could define a
Polyhedra.Variable
type with aPolyhedra.@polyvar
macro and anAffineTerm
and anAffinePolynomial
types.This way, one could define an
HRepresentation
withThe
inequalities
andequalities
iterators would returnAffinePolynomial
s.@rdeits what do you think ?
The text was updated successfully, but these errors were encountered: