On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy

Christoph Grüne, Lasse Wulf

Recoverable robust optimization is a popular multi-stage approach, in which it is possible to adjust a first-stage solution after the uncertain cost scenario is revealed. We consid…