Fast Heuristics for the Maximum Feasible Subsystem Problem

Given an infeasible set of linear constraints, finding the maximum cardinality feasible subsystem is known as themaximum feasible subsystem problem. This problem is known to be NP-hard, but has many practical applications. This paper presents improved heuristics for solving the maximum feasible subsystem problem that are significantly faster than the original, but still highly accurate.

[1]  N. Chakravarti.  Some results concerning post-infeasibility analysis , 1994 .

[2]  Edoardo Amaldi,et al.  The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations , 1995, Theor. Comput. Sci..

[3]  Olvi L. Mangasarian,et al.  Hybrid misclassification minimization , 1996, Adv. Comput. Math..

[4]  Olvi L. Mangasarian,et al.  Misclassification minimization , 1994, J. Glob. Optim..

[5]  John W. Chinneck,et al.  Locating Minimal Infeasible Constraint Sets in Linear Programs , 1991, INFORMS J. Comput..

[6]  John W. Chinneck,et al.  Computer Codes for the Analysis of Infeasible Linear Programs , 1996 .

[7]  Edoardo Amaldi,et al.  From finding maximum feasible subsystems of linear systems to feedforward neural network design , 1994 .

[8]  John W. Chinneck,et al.  Feasibility and Viability , 1997 .

[9]  Leslie E. Trotter,et al.  Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem , 1999, IPCO.

[10]  John M. Wilson,et al.  Advances in Sensitivity Analysis and Parametric Programming , 1998, J. Oper. Res. Soc..

[11]  John W. Chinneck,et al.  MINOS(IIS): Infeasibility analysis using MINOS , 1994, Comput. Oper. Res..

[12]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[13]  Richard LundgrenBurt SimonDate.  A Set Covering Approach to Infeasibility Analysis of Linear Programming Problems and Related Issues By , 1995 .

[14]  Jayaram K. Sankaran.  A note on resolving infeasibility in linear programs by constraint relaxation , 1993, Oper. Res. Lett..

[15]  Marcus R. Frean,et al.  A "Thermal" Perceptron Learning Rule , 1992, Neural Computation.

[16]  Simon Kasif,et al.  A System for Induction of Oblique Decision Trees , 1994, J. Artif. Intell. Res..

[17]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

[18]  P. Wolfe.  The Composite Simplex Algorithm , 1965 .

[19]  Christopher J. Merz,et al.  UCI Repository of Machine Learning Databases , 1996 .

[20]  Kristin P. Bennett,et al.  A Parametric Optimization Method for Machine Learning , 1997, INFORMS J. Comput..