Note on prime representations of convex polyhedral sets

Abstract. Consider a convex polyhedral set represented by a system of linear inequalities. A prime representation f the polyhedron is one that contains no redundant constraints. We present asharp upper bound on the difference between the cardinalities of any two primes. Key Words. Convex polyhedral sets, linear inequalities, minimal rep-resentation, prime representation, redundancy. 1