ISSN:
1573-2878
Keywords:
Convex polyhedral sets
;
linear inequalities
;
minimal representation
;
prime representation
;
redundancy
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00940849
Permalink