Polynomial representations of polyhedra (Q2468441)

This nice paper refers to polynomial representations of convex polyhedral sets (and, in the particular case of boundedness, convex polytopes), as they are useful, e.g., for combinatorial optimization. The author discusses problems that occur if one changes between \(V\)- and \(H\)-representations of polytopes, where the theory of semi-algebraic sets is shown to yield an important background. Many results in this direction are presented and discussed, including construction principles and first results on representations and approximations of polyhedral sets (or more general sets) via polynomial inequality systems.