A Comparative Study of Redundant Constraints Identification Methods in Linear Programming Problems

The objective function and the constraints can be formulated as linear functions of independent variables in most of the real-world optimization problems. Linear Programming (LP) is the process of optimizing a linear function subject to a finite number of linear equality and inequality constraints. Solving linear programming problems efficiently has always been a fascinating pursuit for computer scientists and mathematicians. The computational complexity of any linear programming problem depends on the number of constraints and variables of the LP problem. Quite often large-scale LP problems may contain many constraints which are redundant or cause infeasibility on account of inefficient formulation or some errors in data input. The presence of redundant constraints does not alter the optimal solutions(s). Nevertheless, they may consume extra computational effort. Many researchers have proposed different approaches for identifying the redundant constraints in linear programming problems. This paper compares five of such methods and discusses the efficiency of each method by solving various size LP problems and netlib problems. The algorithms of each method are coded by using a computer programming language C. The computational results are presented and analyzed in this paper.

[1]  J. Telgen.  Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints , 1983 .

[2]  Harvey J. Greenberg,et al.  Consistency, redundancy, and implied equalities in linear systems , 2005, Annals of Mathematics and Artificial Intelligence.

[3]  P.-O. Gutman,et al.  On the generalized Wolf problem: Preprocessing of nonnegative large-scale linear programming problems with group constraints , 2007 .

[4]  T. Gal.  Weakly redundant constraints and their impact on postoptimal analyses in LP , 1992 .

[5]  J. Boot,et al.  On Trivial and Binding Constraints in Programming Problems , 1962 .

[6]  Predrag S. Stanimirovic,et al.  Two Direct Methods in Linear Programming , 2001, Eur. J. Oper. Res..

[7]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[8]  Erling D. Andersen,et al.  Presolving in linear programming , 1995, Math. Program..

[9]  Gautam Mitra,et al.  Analysis of mathematical programming problems prior to applying the simplex algorithm , 1975, Math. Program..

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

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

[12]  C. Chellappan,et al.  A heuristic approach for identification of redundant constraints in linear programming models , 2006, Int. J. Comput. Math..

[13]  T. H. Mattheiss,et al.  An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities , 1973, Oper. Res..

[14]  M. Balinski.  An algorithm for finding all vertices of convex polyhedral sets , 1959 .

[15]  Stanley Zionts,et al.  Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems , 1966 .

[16]  Richard J. Caron,et al.  Constraint classification in mathematical programming , 1993, Math. Program..