Polynomial inequalities representing polyhedra
度量几何
2007-05-23 v1 代数几何
最优化与控制
摘要
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.
引用
@article{arxiv.math/0307190,
title = {Polynomial inequalities representing polyhedra},
author = {Hartwig Bosse and Martin Groetschel and Martin Henk},
journal= {arXiv preprint arXiv:math/0307190},
year = {2007}
}
备注
9 pages