The representation of polyhedra by polynomial inequalities

9Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 d-dimensional polyhedron admits a representation as the set of solutions of at most d(d + 1)/2 polynomial inequalities. Even in this polyhedral case, however, no constructive proof is known, even if the quadratic upper bound is replaced by any bound depending only on the dimension. Here we give, for simple polytopes, an explicit construction of polynomials describing such a polytope. The number of used polynomials is exponential in the dimension, but in the two- and three-dimensional case we get the expected number d(d + l)/2.

Cite

CITATION STYLE

APA

Grötschel, M., & Henk, M. (2003). The representation of polyhedra by polynomial inequalities. Discrete and Computational Geometry, 29(4), 485–504. https://doi.org/10.1007/s00454-003-0782-y

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free