Robust optimization is a methodology that can be applied to problems that are affected by uncertainty in their parameters. The classical robust counterpart of a problem requires the solution to be feasible for all uncertain parameter values in a so-called uncertainty set and offers no guarantees for parameter values outside this uncertainty set. The globalized robust counterpart (GRC) extends this idea by allowing controlled constraint violations in a larger uncertainty set. The constraint violations are controlled by the distance of the parameter from the original uncertainty set. We derive tractable GRCs that extend the initial GRCs in the literature: our GRC is applicable to nonlinear constraints instead of only linear or conic constraints, and the GRC is more flexible with respect to both the uncertainty set and distance measure function, which are used to control the constraint violations. In addition, we present a GRC approach that can be used to provide an extended trade-off overview between the objective value and several robustness measures.
- robust optimization
- globalized robust counterpart
- constraint violations
Ben-Tal, A., Brekelmans, R., den Hertog, D., & Vial, J. P. (2017). Globalized robust optimization for nonlinear uncertain inequalities. INFORMS Journal on Computing, 29(2), 350-366. https://doi.org/10.1287/ijoc.2016.0735