A Redundant Linear Constraint Elimination Technique
Published Date: April 1, 1990
In linear programming, the goal is to solve for an M-dimensional vector, x, that minimizes (or maximizes) a linear 'cost' function, and which satisfies certain linear constraints. This paper concentrates specifically on these linear constraints, provides techniques for simplifying the linear programming problem by eliminating unneeded constraints, and presents a technique for identifying and eliminating redundant constraints.
