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.
- minimal representation
- linear inequalities
- prime representation
- Convex polyhedral sets
Boneh, A., Caron, R. J., Lemire, F. W., McDonald, J. F., Telgen, J., & Vorst, T. (1989). Note on prime representations of convex polyhedral sets. Journal of optimization theory and applications, 61(1), 137-142. https://doi.org/10.1007/BF00940849