We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Generalized light robustness and the trade-off between robustness and nominal quality.
- Authors
Schöbel, Anita
- 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, ) 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, ), reliability (Ben-Tal and Nemirovski in Math Program A 88:411-424, ) or the approach of Bertsimas and Sim (Oper Res 52(1):35-53, ). 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.
- Subjects
CONJOINT analysis; GENERALIZABILITY theory; NOMINAL measurement; QUALITY of service; ROBUST optimization; DATA analysis; COST analysis
- Publication
Mathematical Methods of Operations Research, 2014, Vol 80, Issue 2, p161
- ISSN
1432-2994
- Publication type
Article
- DOI
10.1007/s00186-014-0474-9