As linear programs have grown larger and more complex, infeasible models are appearing more frequently. Because of the scale and complexity of the models, automated assistance is very often needed in determining the cause of the infeasibility so that model repairs can be made. Fortunately, researchers have developed algorithms for analysing infeasible LPs in recent years, and these have lately found their way into commercial LP computer codes. This paper briefly reviews the underlying algorithms, surveys the computer codes, and compares their performance on a set of test problems.

, ,
Journal of the Operational Research Society
Carleton University

Chinneck, J. (1996). Computer codes for the analysis of infeasible linear programs. Journal of the Operational Research Society, 47(1), 61–72.