COMPUTER CODES FOR THE ANALYSIS OF INFEASIBLE LINEAR-PROGRAMS

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