Polynomial Inequalities Representing Polyhedra
Please always quote using this URN:urn:nbn:de:0296-matheon-1989
- 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.
Author: | Hartwig Bosse, Martin Grötschel, Martin Henk |
---|---|
URN: | urn:nbn:de:0296-matheon-1989 |
Referee: | Günter M. Ziegler |
Document Type: | Preprint, Research Center Matheon |
Language: | English |
Date of first Publication: | 2004/12/22 |
Release Date: | 2004/12/21 |
Institute: | Zuse Institute Berlin (ZIB) |
Preprint Number: | 187 |