Generalized filtering algorithms for infeasibility analysis

Computers and Operations Research

Volumn 35, Issue 5, 2008, Pages 1446-1464

  Atlihan, Mustafa K ^a   Schrage, Linus ^b  

^a Lindo Systems   (United States)

^b UNIVERSITY OF CHICAGO   (United States)

Author keywords

Binary search; Infeasible systems; Irreducibly inconsisent systems; Nonlinear optimization

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; NONLINEAR PROGRAMMING; SEARCH ENGINES;

BINARY SEARCH; INFEASIBLE SYSTEMS; IRREDUCIBLY INCONSISENT SYSTEMS; NONLINEAR OPTIMIZATION;

PROGRAM DEBUGGING;

EID: 34748825593     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.08.005     Document Type: Article

References (18)

1. van Loon J. Irreducibly inconsistent systems of linear inequalities. European Journal of Operational Research 8 (1981) 283-288
2. Gleeson J., and Ryan J. Identifying minimally infeasible subsystems of inequalities. ORSA Journal of Computing 2 1 (1990) 61-63
3. Chinneck J.W., and Dravnieks E.W. Locating minimal infeasible constraint sets in linear programs. ORSA Journal on Computing 3 (1991) 157-168
4. Tamiz M., Mardle S., and Jones D. Detecting is in infeasible linear programmes using techniques from goal programming. Computers and Operations Research 23 (1996) 113-119
5. Guieu O., and Chinneck J.W. Analyzing infeasible mixed integer and integer linear programs. INFORMS Journal on Computing 11 (1999) 63-77
6. Chinneck J.W. Analyzing infeasible nonlinear programs. Computational Optimization and Applications 4 (1995) 167-179
7. Andersen E.D. On primal and dual infeasibility certificates in a homogeneous model for convex optimization. SIAM Journal on Optimization 11 2 (2000) 380-388
8. Chinneck J.W. Computer codes for the analysis of infeasible linear programs. Journal of the Operational Research Society 47 (1996) 61-72
9. Chinneck J.W. Finding a useful subset of constraints for analysis in an infeasible linear program. INFORMS Journal on Computing 9 2 (1997) 164-174
10. Lindo Systems, Inc. LINDO API User's Guide, Version 4.0, 2005. 〈http://www.lindo.com〉.
11. Markowitz H.M. Portfolio selection (1959), Blackwell, Oxford
12. Drezner Z. Facility location: a survey of applications and methods (1995), Springer, New York
13. Alizadeh F., and Goldfarb D. Second-order cone programming. Mathematical Programming 95 1 (2003) 3-51
14. Lobo M.S., Vandenberghe L., Boyd S., and Lebret L. Applications of second-order cone programming. Linear Algebra and its Applications 284 1-3 (1998) 193-228
15. Floudas C.A., Pardalos P.M., Adjiman C., Esposito W.R., Gumus Z.H., Harding S.T., et al. Handbook of test problems in local and global optimization (1999), Kluwer Academic Publishers, Dordrecht
16. Dolan E.D., and Moré J.J. Benchmarking optimization software with performance profiles. Mathematical Programming 91 2 (2002) 201-213
17. Chinneck J.W. An effective polynomial-time heuristic for the minimum-cardinality is set-covering problem. Annals of Mathematics and Artificial Intelligence 17 (1996) 127-144
18. Schrage L. Optimization modeling with LINDO (1997), Scientific Press