Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have