Note on Prime Representation of Convex Polyhedral Sets

Consider a convex polyhedral set represented by a system of linear inequalities. A prime representation of the polyhedron is one that contains no redundant constraints. We present a sharp upper bound on the difference between the cardinalities of any two primes. © 1989 Plenum Publishing Corporation