Computer codes for the analysis of infeasible linear programs

Journal of the Operational Research Society

Volumn 47, Issue 1, 1996, Pages 61-72

  Chinneck, John W ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Formulation assistance; Infeasibility analysis; Linear programming

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; MATHEMATICAL MODELS;

FORMULATION ASSISTANCE; INFEASIBLE LINEAR PROGRAMS;

LINEAR PROGRAMMING;

EID: 0029775543     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1996.6     Document Type: Article

References (27)

1. J. W. Chinneck and E. W. Dravnieks (1991) Locating minimal infeasible constraint sets in linear programs. ORSA J. Computing 3, 157-168.
2. J. W. Chinneck (1993) MINOS(IIS) 4.2 User’s Manual. Systems and Computer Engineering technical report SCE-93-17, Carleton University, Ottawa, Canada.
3. J. W. Chinneck (1994) MINOS(IIS): infeasibility analysis using MINOS. Comps and Opns Res. 21 (1), 1-9.
4. R. A. Main (1993) Infeasibility Analysis Using CLAUDIA - /. BP Oil International, Oil Technology Centre, technical report.
5. R. A. Main (1993) Infeasibility Analysis Using CLAUDIA -II. BP Oil International, Oil Technology Centre, technical report.
6. L. Schrage (1991) LINDO: an Optimization and Modeling System, 4th Edn. The Scientific Press, San Francisco.
7. CPLEX (1994) Using the CPLEX Callable Library and CPLEX Mixed Integer Library. CPLEX Optimization Inc, Incline Village, NV, USA.
8. H. J. Greenberg (1993) A Computer-Assisted Analysis System for Mathematical Programming Models and Solutions: A User’s Guide for ANALYZE. Kluwer Academic Publishers, Boston.
9. H. J. Greenberg and F. H. Murphy (1991) Approaches to diagnosing infeasible linear programs. ORSA J. Computing 3, 253-261.
10. A. L. Brearly, G. Mitra and H. P. Williams (1975) Analysis of mathematical programming problems prior to applying the simplex algorithm. Math. Prog. 8, 54-83.
11. D. Gale (1957) A theorem in networks. Pacific J. Mathematics 7, 1073-1082.
12. D. R. Fulkerson (1959) A network flow feasibility theorem and combinatorial applications. Canadian J. Mathematics 11, 440-451.
13. A. J. Hoffman (1960) Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. Proceedings of Symposia on Applied Mathematics 10, 113-127.
14. L. R. Ford and D. R. Fulkerson (1962) Flows in Networks. Princeton University Press, Princeton, New Jersey.
15. J. Hao and J. B. Orlin (1992). Diagnosing infeasibilities for minimum cost flow problems. Presented at ORSA/TIMS conference, Orlando.
16. H. J. Greenberg (1987) Diagnosing infeasibility for min-cost network flow models, part I: dual infeasibility. IMA J. Mathematics in Mgmt 1, 99-109.
17. H. J. Greenberg (1988) Diagnosing infeasibility for min-cost network flow models, part II: primal infeasibility. IMA J. Mathematics Applied in Business and Industry 2, 1-12.
18. J. van Loon (1981) Irredueibly inconsistent systems of linear inequalities. Eur. J. Opl Res. 8, 283-288.
19. J. W. Chinneck (1993) Finding the Most Useful Subset of Constraints for Analysis in an Infeasible Linear Program. Systems and Computer Engineering technical report SCE-93-07, Carleton University, Ottawa, Canada.
20. G. Brown and G. Graves (1975) Elastic programming: a new approach to large-scale mixed integer optimization. Presented at ORSA/TIMS conference, Las Vegas.
21. J. Gleeson and J. Ryan (1990) Identifying minimally infeasible subsystems of equations. ORSA J. Computing 2, 61-63.
22. J. Ryan (1991) Transversals of IlS-hypergraphs. Congressus Numerantium 81, 17-22
23. M. Parker and J. Ryan (1994) Finding the Maximum Weight Feasible Subsystem of an Infeasible System of Linear Inequalities. Working paper, Mathematics Department, University of Colorado at Denver.
24. E. Almaldi and V. Kann (1995) The complexity and approximability of finding maximum feasible subsystems of linear relations. Theoretical Computer Sci. 147, 181-210.
25. J. W. Chinneck (1995) An Effective Polynomial-Time Heuristic for the Minimum-Cardinality IIS Set-Covering Problem. To appear in Annals of Mathematics and Artificial Intelligence.
26. B. A. Murtagh and M. A. Saunders (1987) MINOS 5.1 User’s Guide. Technical report SOL 83-20R, Systems Optimization Laboratory, Department of Operations Research, Stanford University.
27. E. D. Anderson and K. D. Anderson (1993) Presolving in Linear Programming. Technical report, Department of Management, Odense University, Denmark.