Sensitivity Analysis in Combinatorial Optimization

Authored by: David Fernández-Baca , Balaji Venkatachalam

Handbook of Approximation Algorithms and Metaheuristics, Second Edition

Print publication date:  May  2018
Online publication date:  May  2018

Print ISBN: 9781498770118
eBook ISBN: 9781351236423
Adobe ISBN:


 Download Chapter



Anyone formulating an optimization problem faces uncertainty in selecting the model parameters. Transportation costs, probabilities of different events, budget constraints, among other parameters, are all unlikely to be known with any degree of accuracy. There may also be doubts about the structure of the model, such as whether to add or remove constraints. Understanding the effect of changes in parameter values and model structure on the optimum solution is the subject matter of sensitivity analysis. Our goal in this chapter is to give an overview of the main algorithmic ideas in sensitivity analysis for combinatorial optimization.

Search for more...
Back to top

Use of cookies on this website

We are using cookies to provide statistics that help us give you the best experience of our site. You can find out more in our Privacy Policy. By continuing to use the site you are agreeing to our use of cookies.