Abstract / Description of output
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.
Original language | English |
---|---|
Pages (from-to) | 2597-2610 |
Journal | Optimization letters |
Volume | 15 |
Early online date | 29 Jun 2021 |
DOIs | |
Publication status | Published - 30 Nov 2021 |