Abstract
We consider optimization problems where the exact value of the input data is not known in advance and can be affected by uncertainty. For these problems, one is typically required to determine a robust solution, i.e., a possibly suboptimal solution whose feasibility and cost is not affected heavily by the change of certain input coefficients. Two main classes of methods have been proposed in the literature to handle uncertainty: stochastic programming (offering great flexibility, but often leading to models too large in size to be handled efficiently), and robust optimization (whose models are easier to solve but sometimes lead to very conservative solutions of little practical use). In this paper we investigate a heuristic way to model uncertainty, leading to a modelling framework that we call Light Robustness. Light Robustness couples robust optimization with a simplified two-stage stochastic programming approach, and has a number of important advantages in terms of flexibility and ease to use. In particular, experiments on both random and real word problems show that Light Robustness is sometimes able to produce solutions whose quality is comparable with that obtained through stochastic programming or robust models, though it requires less effort in terms of model formulation and solution time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
El Ghaoui, L., Ben-Tal, A., Nemirovski, A.: Robust Optimization. In: preparation, preliminary draft (2008), http://www2.isye.gatech.edu/~nemirovs/RBnew.pdf
Ben-Tal, A., Nemirovski, A.: Robust solutions to uncertain linear programs. Operations Research Letters 25, 1–13 (1999)
Ben-Tal, A., Nemirovski, A.: Robust solutions of linear programming problems contaminated with uncertain data. Mathematical Programming 88, 411–424 (2000)
Ben-Tal, A., Nemirovski, A.: Robust optimization - methodology and applications. Mathematical Programming 92, 453–480 (2002)
Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Mathematical Programming 98, 49–71 (2003)
Bertsimas, D., Sim, M.: The price of robustness. Operations Research 52, 35–53 (2004)
Bienstock, D.: Histogram models for robust portfolio optimization. The Journal of Computational Finance 11 (2007)
Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. In: Springer Series in Operations Research and Financial Engineering. Springer, Heidelberg (2000)
Caprara, A., Fischetti, M., Toth, P.: Modeling and solving the train timetabling problem. Operations Research 50, 851–861 (2002)
Fischetti, M., Salvagnin, D., Zanette, A.: Fast approaches to improve the robustness of a railway timetable. Research paper, DEI, University of Padova (2007); to apper in Transportation Science
Kall, P., Wallace, S.W.: Stochastic Programming. Wiley, Chichester (1994)
Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)
Linderoth, J.T., Shapiro, A., Wright, S.J.: The empirical behavior of sampling methods for stochastic programming. Annals of Operations Research 142, 219–245 (2006)
Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, Chichester (1990)
Prékopa, A.: Stochastic Programming. Kluwer Academic Publishers, Dordrecht (1995)
Ruszczynski, A., Shapiro, A.: Stochastic Programming. In: Hanbooks in Operations Research and Management Science. Elsevier, Amsterdam (2003)
Serafini, P., Ukovich, W.: A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics 2, 550–581 (1989)
Soyster, A.L.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Operations Research 21, 1154–1157 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fischetti, M., Monaci, M. (2009). Light Robustness. In: Ahuja, R.K., Möhring, R.H., Zaroliagis, C.D. (eds) Robust and Online Large-Scale Optimization. Lecture Notes in Computer Science, vol 5868. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05465-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-05465-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05464-8
Online ISBN: 978-3-642-05465-5
eBook Packages: Computer ScienceComputer Science (R0)