×

zbMATH — the first resource for mathematics

Locating minimal infeasible constraint sets in linear programs. (English) Zbl 0755.90055
Summary: With ongoing advances in hardware and software, the bottleneck in linear programming is no longer a model solution, it is the correct formulation of large models in the first place. During initial formulation (or modification), a very large model may prove infeasible, but it is often difficult to determine how to correct it. We present a formulation aid which analyzes infeasible LPs and identifies minimal sets of inconsistent constraints from among the perhaps very large set of constraints defining the problem. This information helps to focus the search for a diagnosis of the problem, speeding the repair of the model. We present a series of filtering routines and a final integrated algorithm which guarantees the identification of at least one minimal set of inconsistent constraints. This guarantee is a significant advantage over previous methods. The algorithms are simple, relatively efficient, and easily incorporated into standard LP solvers. Preliminary computational results are reported.

MSC:
90C05 Linear programming
90-08 Computational methods for problems pertaining to operations research and mathematical programming
Software:
MINOS
PDF BibTeX Cite
Full Text: DOI