Abstract
The idea of k-adaptability in two-stage robust optimization is to calculate a fixed number k of second-stage policies here-and-now. After the actual scenario is revealed, the best of these policies is selected. This idea leads to a min–max–min problem. In this paper, we consider the case where no first stage variables exist and propose to use this approach to solve combinatorial optimization problems with uncertainty in the objective function. We investigate the complexity of this special case for convex uncertainty sets. We first show that the min–max–min problem is as easy as the underlying certain problem if k is greater than the number of variables and if we can optimize a linear function over the uncertainty set in polynomial time. We also provide an exact and practical oracle-based algorithm to solve the latter problem for any underlying combinatorial problem. On the other hand, we prove that the min–max–min problem is NP-hard for every fixed number k, even when the uncertainty set is a polyhedron, given by an inner description. For the case that k is smaller or equal to the number of variables, we finally propose a fast heuristic algorithm and evaluate its performance.
Similar content being viewed by others
References
Baumann, F., Buchheim, C., Ilyina, A.: Lagrangean decomposition for mean-variance combinatorial optimization. In: Combinatorial Optimization—Third International Symposium, ISCO 2014, Lecture Notes in Computer Science, vol. 8596, pp. 62–74. Springer, Berlin (2014)
Ben-Tal, A., Goryashko, A., Guslitzer, E., Nemirovski, A.: Adjustable robust solutions of uncertain linear programs. Math. Program. 99(2), 351–376 (2004)
Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. Oper. Res. 23(4), 769–805 (1998)
Bertsimas, D., Caramanis, C.: Finite adaptability in multistage linear optimization. IEEE Trans. Autom. Control 55(12), 2751–2766 (2010)
Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. 98(1–3), 49–71 (2003)
Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35–53 (2004)
Bertsimas, D., Sim, M.: Robust discrete optimization under ellipsoidal uncertainty sets (2004)
Blankenship, J.W., Falk, J.E.: Infinitely constrained optimization problems. J. Optim. Theory Appl. 19(2), 261–281 (1976)
Buchheim, C., Kurtz, J.: Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions. In: International Network Optimization Conference—INOC 2015 (to appear)
Büsing, C.: Recoverable robust shortest path problems. Networks 59(1), 181–189 (2012)
El Ghaoui, L., Lebret, H.: Robust solutions to least-squares problems with uncertain data. SIAM J. Matrix Anal. Appl. 18(4), 1035–1064 (1997)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric methods in combinatorial optimization. In: Proceedings of Silver Jubilee Conference on Combinatorics, pp. 167–183 (1984)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1993)
Hanasusanto, G.A., Kuhn, D., Wiesemann, W.: K-adaptability in two-stage robust binary programming. Optim. Online (2015)
Kouvelis, P., Yu, G.: Robust Discrete Optimization and Its Applications. Springer, Berlin (1996)
Liebchen, C., Lübbecke, M., Möhring, R., Stiller, S.: The concept of recoverable robustness, linear programming recovery, and railway applications. In: Robust and Online Large-scale Optimization, pp. 1–27. Springer, Berlin (2009)
Nikolova, E.: Approximation algorithms for reliable stochastic combinatorial optimization. In: Proceedings of APPROX ’10, Barcelona, Spain (2010)
Sim, M.: Robust optimization. Ph.D. thesis, Massachusetts Institute of Technology (2004)
Soyster, A.L.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5), 1154–1157 (1973)
Acknowledgments
We would like to thank the authors of [14] for providing us their instances and computational results for the uncertain shortest path problem.
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper will appear in the Proceedings of the International Network Optimization Conference 2015 [9].
This work has partially been supported by the German Research Foundation (DFG) within the Research Training Group 1855.
Rights and permissions
About this article
Cite this article
Buchheim, C., Kurtz, J. Min–max–min robust combinatorial optimization. Math. Program. 163, 1–23 (2017). https://doi.org/10.1007/s10107-016-1053-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-016-1053-z