Complexity of near-optimal robust versions of multilevel optimization problems

Near-optimality robustness extends multilevel optimization with a limited deviation of a lower level from its optimal solution, anticipated by higher levels. We analyze the complexity of near-optimal robust multilevel problems, where near-optimal robustness is modelled through additional adversarial decision-makers. Near-optimal robust versions of multilevel problems are shown to remain in the same complexity class as the problem without near-optimality robustness under general conditions.

Automated summary

The complexity of near-optimal robust multilevel problems is analyzed, showing that near-optimal robust versions of multilevel problems remain in the same complexity class as the original problems under general conditions.