A Method for Finding Redundant Constraints of a System of Linear Inequalities

Abstract

In principle, any vertex finding algorithm can be employed to find redundant constraints in a system of linear inequalities. All that needs to be noted is the set of constraints active at each vertex visited. Assuming nondegeneracy, any constraint which is active at a vertex is not redundant. For a survey of vertex finding algorithms and some computational experience, see Mattheiss and Rubin (1980).