Abstract
Robust optimization considers optimization problems with uncertainty in the data. The common data model assumes that the uncertainty can be represented by an uncertainty set. Classic robust optimization considers the solution under the worst case scenario. The resulting solutions are often too conservative, e.g. they have high costs compared to non-robust solutions. This is a reason for the development of less conservative robust models. In this paper we extract the basic idea of the concept of light robustness originally developed in Fischetti and Monaci (Robust and online large-scale optimization, volume 5868 of lecture note on computer science. Springer, Berlin, pp 61–84, 2009) for interval-based uncertainty sets and linear programs: fix a quality standard for the nominal solution and among all solutions satisfying this standard choose the most reliable one. We then use this idea in order to formulate the concept of light robustness for arbitrary optimization problems and arbitrary uncertainty sets. We call the resulting concept generalized light robustness. We analyze the concept and discuss its relation to other well-known robustness concepts such as strict robustness (Ben-Tal et al. in Robust optimization. Princeton University Press, Princeton, 2009), reliability (Ben-Tal and Nemirovski in Math Program A 88:411–424, 2000) or the approach of Bertsimas and Sim (Oper Res 52(1):35–53, 2004). We show that the light robust counterpart is computationally tractable for many different types of uncertainty sets, among them polyhedral or ellipsoidal uncertainty sets. We furthermore discuss the trade-off between robustness and nominal quality and show that non-dominated solutions with respect to nominal quality and robustness can be computed by the generalized light robustness approach.
Similar content being viewed by others
References
Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52(1):35–53
Ben-Tal A, El Ghaoui L, Nemirovski A (eds) (2006) Special issue on robust optimization. Mathematical Programming B, vol 107. Springer, Berlin, pp 1–2
Ben-Tal A, Bertsimas D, Brown DB (2010) A soft robust model for optimization under ambiguity. Oper Res 58(4):1220–1234
Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2003) Adjustable robust solutions of uncertain linear programs. Math Program A 99:351–376
Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization. Princeton University Press, Princeton
Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math Oper Res 23(4):769–805
Ben-Tal A, Nemirovski A (1999) Robust solutions of uncertain linear programs. Oper Res Lett 25:1–13
Ben-Tal A, Nemirovski A (2000) Robust solutions of linear programming problems contaminated with uncertain data. Math Program A 88:411–424
Cicerone S, D’Angelo G, Di Stefano G, Frigioni D, Navarra A, Schachtebeck M, Schöbel A (2009) Recoverable robustness in shunting and timetabling. In: Ahuja RK, Möhring RH, Zaroliagis CD (eds) Robust and online large-scale optimization, volume 5868 of lecture notes in computer science. Springer, Berlin, pp 28–60
Cicerone S, Di Stefano G, Schachtebeck M, Schöbel A (2012) Multi-stage recovery robustness for optimization problems: a new concept for planning under disturbances. Inf Sci 190:107–126
Ehrgott M (2005) Multiple criteria optimization, volume 491 of lecture notes in economics and mathematical systems. Springer, Berlin
El Ghaoui L, Lebret H (1997) Robust solutions to least-squares problems with uncertain data. SIAM J Matrix Anal Appl 18:1034–1064
Erera AL, Morales JC, Savelsbergh M (2009) Robust optimization for empty repositioning problems. Oper Res 57(2):468–483
Fischetti M, Monaci M (2008) Light robustness. Research Paper ARRIVAL-TR-0119, ARRIVAL project
Fischetti M, Monaci M (2009) Light robustness. In: Ahuja RK, Möhring RH, Zaroliagis CD (eds) Robust and online large-scale optimization, volume 5868 of lecture note on computer science. Springer, Berlin, pp 61–84
Fischetti M, Salvagnin D, Zanette A (2009) Fast approaches to improve the robustness of a railway timetable. Transp Sci 43:321–335
Goerigk M, Knoth M, Müller-Hannemann M, Schmidt M, Schöbel A (2011) The price of robustness in timetable information. In: Caprara A, Kontogiannis S (eds) 11th Workshop on algorithmic approaches for transportation modelling, optimization, and systems, volume 20 of OpenAccess series in informatics (OASIcs). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp 76–87
Goerigk M, Knoth M, Müller-Hannemann M, Schmidt M, Schöbel A (2014) The price of strict and light robustness in timetable information. Transp Sci 48:225–242
Goerigk M, Schöbel A (2010) An empirical analysis of robustness concepts for timetabling. In: Erlebach T, Lübbecke M (eds) Proceedings of ATMOS10, volume 14 of OpenAccess Series in Informatics (OASIcs). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik Dagstuhl, Germany, pp 100–113
Goerigk M, Schöbel A (2011) A scenario-based approach for robust linear optimization. In: Proceedings of the 1st international ICST conference on practice and theory of algorithms in (computer) systems (TAPAS), lecture notes in computer science. Springer, Berlin, pp 139–150
Goerigk M, Schöbel A (2013) Algorithm engineering in robust optimization. Technical report, Preprint-Reihe, Institut für Numerische und Angewandte Mathematik, Universität Göttingen
Klamroth K, Köbis E, Schöbel A, Tammer C (2013) A unified approach for different concepts of robustness and stochastic programming via nonlinear scalarizing functionals. Optimization 62(5):649–671
Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer, Dordrecht
Liebchen C, Lübbecke M, Möhring RH, Stiller S (2009) The concept of recoverable robustness, linear programming recovery, and railway applications. In: Ahuja RK, Möhring RH, Zaroliagis CD (eds) Robust and online large-scale optimization, volume 5868 of lecture note on computer science. Springer, Berlin
Rockafellar RT (1970) Convex analysis. Princeton Landmarks, Princeton
Schöbel A, Kratz A (2009) A bicriteria approach for robust timetabling. In: Ahuja RK, Möhring RH, Zaroliagis CD (eds) Robust and online large-scale optimization, volume 5868 of lecture notes in computer science. Springer, Berlin, pp 119–144
Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper Res 21:1154–1157
Stiller S (2008) Extending concepts of reliability. Network creation games, real-time scheduling, and robust optimization. PhD thesis, TU Berlin
Ward JE, Wendell RE (1985) Using block norms for location modeling. Oper Res 33:1074–1090
Author information
Authors and Affiliations
Corresponding author
Additional information
Anita Schöbel: Partially supported by grant SCHO 1140/3-2 within the DFG programme Algorithm Engineering.
Rights and permissions
About this article
Cite this article
Schöbel, A. Generalized light robustness and the trade-off between robustness and nominal quality. Math Meth Oper Res 80, 161–191 (2014). https://doi.org/10.1007/s00186-014-0474-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-014-0474-9