Access the full text.
Sign up today, get DeepDyve free for 14 days.
H. Greenberg (1993)
A computer-assisted analysis system for mathematical programming models and solutions : a user's guide for ANALYZE
E. Amaldi, V. Kann (1994)
On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems
N. Chakravarti (1994)
Some results concerning post-infeasibility analysisEuropean Journal of Operational Research, 73
(1975)
Elastic programming: A new approach to large-scale mixed integer optimization, ORSA/TIMS Col~
J. Sankaran (1993)
A note on resolving infeasibility in linear programs by constraint relaxationOper. Res. Lett., 13
E. Amaldi, V. Kann (1995)
The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear RelationsTheor. Comput. Sci., 147
J. Chinneck, Erik Dravnieks (1991)
Locating Minimal Infeasible Constraint Sets in Linear ProgramsINFORMS J. Comput., 3
J. Gleeson, J. Ryan (1990)
Identifying Minimally Infeasible Subsystems of InequalitiesINFORMS J. Comput., 2
Joyce Loon (1981)
Irreducibly inconsistent systems of linear inequalitiesEuropean Journal of Operational Research, 8
A heuristic for the I1S set-covering problem
J. Chinneck (1994)
MINOS(IIS): Infeasibility analysis using MINOSComput. Oper. Res., 21
(1991)
Transversals of IIS-hypergraphs
P. Wolfe (1965)
The Composite Simplex AlgorithmSiam Review, 7
(1993)
Infeasibility analysis using CLAUDIA -II, BP Oil International, Oil Technology Centre
(1994)
Finding the maximum weight feasible subsystem of an infeasible system of linear inequalities
(1991)
LINDO: An Optimization and Modelblg System
J. Chinneck (1996)
Computer Codes for the Analysis of Infeasible Linear ProgramsJournal of the Operational Research Society, 47
J. Gleeson, J. Ryan (1990)
Identifying minimally infeasible subsystems of equationsORSA J. Comput., 2
N. Karmarkar (1984)
A new polynomial-time algorithm for linear programmingCombinatorica, 4
H. Greenberg (1993)
A Computer-Assisted Analysis System for Mathematical Programming Models and Solutions
J.W. Chinneck (1993)
Finding the most useful subset of constraints for analysis in an infeasible linear program
Dafydd Gibbon, Roger Moore, Richard Winski (1998)
1 User’s guide
E. Amaldi, V. Kann, Min Ulrr (1995)
On the Approximability of Removing the Smallest Number of Relations from Linear Systems to Achieve Feasibility
The state-of-the-art methods for analyzing infeasible linear programs concentrate on isolating Irreducible Infeasible Sets (IISs) of constraints. However, when there are numerous infeasibilities in the model, it is also useful to identify a minimum-cardinality set of constraints which, if removed from the LP, renders it feasible. This set of constraintscovers the IISs. This paper presents a heuristic algorithm for finding a small-cardinality set of constraints which covers the IISs in an infeasible LP. Empirical tests show that it finds a true minimum-cardinality cover over all of the examples in a test set, though this performance cannot be guaranteed in general.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Dec 8, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.