Detecting IIS in infeasible linear programmes using techniques from goal programming

DOI10.1016/0305-0548(95)00018-HzbMath0868.90080OpenAlexW1981066696WikidataQ127213137 ScholiaQ127213137MaRDI QIDQ2563884

Mehrdad Tamiz, S. J. Mardle, Dylan F. Jones

Publication date: 6 January 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(95)00018-h

zbMATH Keywords

goal programmingirreducibly inconsistent systems

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

K-best feasible clusters - ranking optimal solutions from an infeasible LP ⋮ Error correction for massive datasets ⋮ Solution techniques for the large set covering problem ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ Finding Guaranteed MUSes Fast ⋮ Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition ⋮ Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models ⋮ Preferential reducts and constructs in robust multiple criteria ranking and sorting ⋮ Generalized filtering algorithms for infeasibility analysis ⋮ Infeasibility resolution based on goal programming ⋮ Identifying relatively irreducible infeasible subsystems of linear inequalities ⋮ Automatic repair of convex optimization problems ⋮ On exact selection of minimally unsatisfiable subformulae ⋮ Extending linear relaxation for non-square matrices and soft constraints ⋮ Goal programming for decision making: An overview of the current state-of-the-art ⋮ On optimal zero-preserving corrections for inconsistent linear systems ⋮ Hildreth's algorithm with applications to soft constraints for user interface layout ⋮ Resolving inconsistencies among constraints on the parameters of an MCDA model ⋮ Interactive group decision making procedure under incomplete information

Uses Software

• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Irreducibly inconsistent systems of linear inequalities
• MINOS(IIS): Infeasibility analysis using MINOS
• A review of goal programming and its applications
• Identifying Minimally Infeasible Subsystems of Inequalities
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program