Abstract
The constraint programming community has recently begun to address certain types of optimization problems. These problems tend to be discrete or to have discrete elements. Although sensitivity analysis is well developed for continuous problems, progress in this area for discrete problems has been limited. This paper proposes a general approach to sensitivity analysis that applies to both continuous and discrete problems. In the continuous case, particularly in linear programming, sensitivity analysis can be obtained by solving a dual problem. One way to broaden this result is to generalize the classical idea of a dual to that of an “inference dual,” which can be defined for any optimization problem. To solve the inference dual is to obtain a proof of the optimal value of the problem. Sensitivity analysis can be interpreted as an analysis of the role of each constraint in this proof. This paper shows that traditional sensitivity analysis for linear programming is a special case of this approach. It also illustrates how the approach can work out in a discrete problem by applying it to 0–1 linear programming (linear pseudo-boolean optimization).
Partially supported by U.S. Office of Naval Research grant N00014-95-1-0517.
Preview
Unable to display preview. Download preview PDF.
References
Barth, P., Logic-Based 0–1 Constraint Solving in Constraint Logic Programming, Kluwer (Dordrecht, 1995).
Chvátal, V., Linear Programming, W. H. Freeman (New York, 1983).
Cooper, M. C., An optimal k-consistency algorithm, Artificial Intelligence 41 (1989) 89–95.
Hooker, J. N., A quantitative approach to logical inference, Decision Support Systems 4 (1988) 45–69.
Hooker, J. N., Generalized resolution for 0–1 linear inequalities, Annals of Mathematics and Artificial Intelligence 6 (1992) 271–286.
Hooker, J. N., Logic-based methods for optimization, in A. Borning, ed., Principles and Practice of Constraint Programming, Lecture Notes in Computer Science 874 (1994) 336–349.
Hooker, J. N., Logic-based Benders decomposition (1996). Available on http://www.gsia.cmu.edu/afs/andrew/afs/jh38/jnh.html.
Nemhauser, G. L., and L. A. Wolsey, Integer and Combinatorial Optimization, Wiley (New York, 1988).
Quine, W. V., The problem of simplifying truth functions, American Mathematical Monthly 59 (1952) 521–531.
Quine, W. V., A way to simplify truth functions, American Mathematical Monthly 62 (1955) 627–631.
Robinson, J. A., A machine-oriented logic based on the resolution principle, Journal of the. ACM 12 (1965) 23–41.
Schrage, L., and L. Wolsey, Sensitivity analysis for branch and bound integer programming, Operations Research 33 (1985) 1008–1023.
Schrijver, A., Theory of Linear and Integer Programming, Wiley (Chichester, 1986).
Skorin-Kapov, J., and F. Granot, Nonlinear integer programming: Sensitivity analysis for branch and bound, Operations Research Letters 6 (1987) 269–274.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hooker, J.N. (1996). Inference duality as a basis for sensitivity analysis. In: Freuder, E.C. (eds) Principles and Practice of Constraint Programming — CP96. CP 1996. Lecture Notes in Computer Science, vol 1118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61551-2_77
Download citation
DOI: https://doi.org/10.1007/3-540-61551-2_77
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61551-4
Online ISBN: 978-3-540-70620-5
eBook Packages: Springer Book Archive