Showing math.MGShow all
2 papers · 1 filter
math.MG2003
Polynomial inequalities representing polyhedra
Hartwig Bosse, Martin Groetschel, Martin Henk
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…
math.MG2002
On the representation of polyhedra by polynomial inequalities
Martin Grötschel, Martin Henk
A beautiful result of Bröcker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every -dimensional polyhedron admit…