Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s10107-004-0563-2 | Math. Program. |
Keywords | Field | DocType |
main result,polynomial inequality,arbitrary polyhedron,constructible representation,polyhedral cone,n-dimensional polytope,polyhedral combinatorics | Discrete mathematics,Combinatorics,Mathematical optimization,Polynomial,Stability index,Polyhedron,Polytope,Polynomial inequalities,Matrix polynomial,Mathematics,Polyhedral combinatorics | Journal |
Volume | Issue | ISSN |
103 | 1 | 1436-4646 |
Citations | PageRank | References |
3 | 0.63 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hartwig Bosse | 1 | 56 | 3.86 |
| Martin Grötschel | 2 | 1570 | 724.54 |
| Martin Henk | 3 | 20 | 4.24 |