Complexity of near-optimal robust versions of multilevel optimization problems

Mathieu Besançon, Miguel F Anjos, Luce Brotcorne

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)2597-2610
JournalOptimization letters
Volume15
Early online date29 Jun 2021
DOIs
Publication statusPublished - 30 Nov 2021

Fingerprint

Dive into the research topics of 'Complexity of near-optimal robust versions of multilevel optimization problems'. Together they form a unique fingerprint.

Cite this