Approximation Guarantees for Min-Max-Min Robust Optimization and \({\boldsymbol{k}}\)-Adaptability Under Objective Uncertainty
SIAM Journal on Optimization · 30.06.2024 · 34 (2) · 2121-2149
DOI: 10.1137/23m1595084 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Optimization, online erschienen am 17.06.2024. Verfasst von Jannis Kurtz. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 42 Literaturangaben.
Abstract (Originalsprache)
In this work we investigate the min-max-min robust optimization problem and the k-adaptability robust optimization problem for binary problems with uncertain costs. The idea of the first approach is to calculate a set of k feasible solutions which are worst-case optimal if in each possible scenario the best of the k solutions is implemented. It is known that the min-max-min robust problem can be solved efficiently if k is at least the dimension of the problem, while it is theoretically and computationally hard if k is small. However, nothing is known about the intermediate case, i.e., k lies between one and the dimension of the problem. We approach this open question and present an approximation algorithm which achieves good problem-specific approximation guarantees for the cases where k is close to or a fraction of the dimension. The derived bounds can be used to show that the min-max-min robust problem is solvable in oracle-polynomial time under certain conditions even if k is smaller than the dimension. We extend the previous results to the robust k-adaptability problem. As a consequence we can provide bounds on the number of necessary second-stage policies to approximate the exact two-stage robust problem. We derive an approximation algorithm for the k-adaptability problem which has similar guarantees as for the min-max-min problem. Finally, we test both algorithms on knapsack and shortest path problems. The experiments show that both algorithms calculate solutions with relatively small optimality gap in seconds.
Zitieren
APA
Kurtz, J. (2024). Approximation Guarantees for Min-Max-Min Robust Optimization and \({\boldsymbol{k}}\)-Adaptability Under Objective Uncertainty. SIAM Journal on Optimization, 34(2), 2121-2149. https://doi.org/10.1137/23m1595084
Vancouver
Kurtz J. Approximation Guarantees for Min-Max-Min Robust Optimization and \({\boldsymbol{k}}\)-Adaptability Under Objective Uncertainty. SIAM Journal on Optimization. 2024;34(2):2121-2149. doi:10.1137/23m1595084
BibTeX
@article{Kurtz2024,
author = {Kurtz, Jannis},
title = {Approximation Guarantees for Min-Max-Min Robust Optimization and \(\boldsymbolk\)-Adaptability Under Objective Uncertainty},
journal = {SIAM Journal on Optimization},
year = {2024},
volume = {34},
number = {2},
pages = {2121--2149},
doi = {10.1137/23m1595084}
}
EUVIMED