Analyzing infeasible mixed-integer and integer linear programs

INFORMS Journal on Computing

Volumn 11, Issue 1, 1999, Pages 63-77

  Guieu, Olivier ^a   Chinneck, John W ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Infeasibility; Mixed integer and integer linear programming

Indexed keywords

EID: 0007993386     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.11.1.63     Document Type: Article

References (10)

1. R. BREU and C.A. BURDET, 1974. Branch and Bound Experiments in Zero-One Programming, Mathematical Programming Study 2, 1-50.
2. J.W. CHINNECK, 1994. MINOS(IIS): Infeasibility Analysis Using MINOS, Computers and Operations Research 21, 1-9.
3. J.W. CHINNECK, 1995. Analyzing Infeasible Nonlinear Programs, Computational Optimization and Applications 4, 167-179.
4. J.W. CHINNECK, 1996. Computer Codes for the Analysis of Infeasible Linear Programs, Journal of the Operational Research Society 47, 61-72.
5. J.W. CHINNECK, 1997. Feasibility and Viability, in Advances in Sensitivity Analysis and Parametric Programming, T. Gal and H.J. Greenberg (eds.), International Series in Operations Research and Management Science 6, 14-1 to 14-41, Kluwer Academic Publishers, Boston.
6. J.W. CHINNECK, 1997. Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program, INFORMS Journal on Computing 9, 164-174.
7. J.W. CHINNECK and E.W. DRAVNIEKS, 1991. Locating Minimal Infeasible Constraint Sets in Linear Programs, ORSA Journal on Computing 3, 157-168.
8. CPLEX OPTIMIZATION INC., 1994. Using the CPLEX Callable Library.
9. R.E. GOMORY, 1963. An Algorithm for Integer Solutions to Linear Programs, in Recent Advances in Mathematical Programming, McGraw-Hill Book Company, New York.
10. 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.