Inference-based sensitivity analysis for mixed integer/linear programming

Operations Research

Volumn 48, Issue 4, 2000, Pages 623-634

  Dawande, M W ^a   Hooker, J N ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PERTURBATION TECHNIQUES; PIECEWISE LINEAR TECHNIQUES; SENSITIVITY ANALYSIS; THEOREM PROVING;

BRANCH AND CUT TREE; INFERENCE DUALITY; MINIMIZATION PROBLEM; MIXED INTEGER LINEAR PROGRAMMING;

OPERATIONS RESEARCH;

EID: 0034221383     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.48.4.623.12420     Document Type: Article

References (25)

1. Blair, C. E. 2000. Integer and mixed integer programming. In Recent Advances in Sensitivity Analysis and Parametric Programming. T. Gal, H. J. Greenberg (eds.). Kluwer. to appear.
2. _, R. G. Jeroslow. 1977a. The value function of a mixed integer program I. Discrete Appl. Math. 19 121-138.
3. _,_. 1977b. The value function of a mixed integer program: II. Discrete Appl. Math. 25 7-19.
4. _,_. 1982. The value function of an integer program. Math. Programming 23 237-273.
5. _,_. 1984. Constructive characterizations of the value function of a mixed-integer program I. Discrete Appl. Math. 9 217-233.
6. _,_. 1985. Constructive characterizations of the value function of a mixed-integer program II. Discrete Appl. Math. 10 227-240.
7. Cook, W., A. M. H. Gerards, A. Schrijver, E. Tardos. 1986. Sensitivity theorems in integer linear programming. Math. Programming 34 251-264.
8. Dawande M., S. Gavirneni, S. Tayur. 1996. Effective heuristics for multi-product shipment models. Tech. Report TR-96-05, GSIA, Carnegie Mellon University.
9. Hooker, J. N. 1988. A quantitative approach to logical inference. Decision Support Systems 4 45-69.
10. _. 1992. Generalized resolution for 0-1 linear inequalities. Ann. Math. and Artificial Intelligence 6 271-286.
11. _. 1994. Logic-based methods for optimization. In Principles and Practice of Constraint Programming, Lecture Notes in Computer Science. A. Borning (ed.), 874 336-349.
12. _. 1996a. Logic-based Benders decomposition. Available on http://www.gsia.cmu.edu/afs/andrew/gsia/jh38/papers.html.
13. _. 1996b. Inference duality as a basis for sensitivity analysis. In Principles and Practice of Constraint Programming-CP96. Lecture Notes in Computer Science 1118, E. C. Freuder (ed.), Springer 224-236. (Also to appear in Constraints.)
14. _, M. A. Osorio. 1999. Mixed logical/linear programming. Discrete Appl. Math. 96-97 395-442.
15. Nemhauser, G. L., L. A. Wolsey. 1988. Integer Programming and Combinatorial Optimization. Wiley, New York.
16. Peterson, C. C. 1965. Selection of new research and development opportunities in light of budget constraints. Master's Thesis, Arizona State University.
17. _. 1967. Computational experience with variants of the Balas algorithm applied to the selection of R&D projects. Management Sci. 13 736-750.
18. Quine, W. V. 1952. The problem of simplifying truth functions. Amer. Math. Monthly 59 521-531.
19. _, 1955. A way to simplify truth functions. Amer. Math. Monthly 62 627-631.
20. Schrage, L., L. Wolsey. 1985. Sensitivity analysis for branch and bound integer programming. Oper. Res. 33 1008-1023.
21. Skorin-Kapov, J., F. Granot. 1987. Nonlinear integer programming: Sensitivity analysis for branch and bound. Oper. Res. Lett. 6 269-274.
22. Tind, J., L. A. Wolsey. 1981. An elementary survey of general duality theory in mathematical programming. Math. Programming 21 241-261.
23. Tsang, E. 1993. Foundations of Constraint Satisfaction. Academic Press, London.
24. Wolsey, L. A. 1981a. Integer programming duality: price functions and sensitivity analysis. Math. Programming 20 173-195.
25. _. 1981b. The b-hull of an integer program. Discrete Appl. Math. 3 193-201.