论文信息 - Note on prime representations of convex polyhedral sets

Note on prime representations 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.

[1] J. Telgen. Minimal representation of convex polyhedral sets , 1982 .

[2] J. F. McDonald,et al. A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary , 1989 .

[3] M. Karwan,et al. Redundancy in mathematical programming : a state-of-the-art survey , 1983 .