2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/68069Our 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 pagesMetric GeometryAlgebraic GeometryOptimization and Control52B11;14P10;90C27text