Polynomial inequalities representing polyhedra

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
9 pages

Keywords

Metric Geometry, Algebraic Geometry, Optimization and Control, 52B11;14P10;90C27

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/68069

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0307190
 http://arxiv.org/abs/math/0307190

Collections

arXiv