Polynomial inequalities representing polyhedra

Simple item page
dc.creatorBosse, Hartwig
dc.creatorGroetschel, Martin
dc.creatorHenk, Martin
dc.date2003-07-14
dc.date.accessioned2026-07-07T04:59:38Z
dc.date.available2026-07-07T04:59:38Z
dc.descriptionOur 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.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/math/0307190
dc.identifierhttp://arxiv.org/abs/math/0307190
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/68069
dc.subjectMetric Geometry
dc.subjectAlgebraic Geometry
dc.subjectOptimization and Control
dc.subject52B11;14P10;90C27
dc.titlePolynomial inequalities representing polyhedra
dc.typetext

Files

Collections

arXiv