On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective

Christoph Buchheim, Dorothee Henke, Felix Hommelsheim

We investigate the complexity of bilevel combinatorial optimization with uncertainty in the follower's objective, in a robust optimization approach. We show that the robust counter…