TY - GEN
A1 - Bosse, Hartwig
A1 - GrÃ¶tschel, Martin
A1 - Henk, Martin
T1 - Polynomial Inequalities Representing Polyhedra
N2 - Our main result is that every $n$-dimensional polytope can be described by at most $2n-1$ polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an $n$-dimensional pointed polyhedral cone we prove the bound $2n-2$ and for arbitrary polyhedra we get a constructible representation by $2n$ polynomial inequalities.
T3 - ZIB-Report - 04-53
KW - polyhedra and polytopes
KW - semi-algebraic sets
KW - polyhedral combinatorics
KW - polynomial inequalities
KW - stability index
Y1 - 2004
UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/828
UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-8284
ER -