| HAL-Inria | Publications, software ... of Inria's scientists |
Complexity of near-optimal robust versions of multilevel optimization problems
Abstract : 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 decisionmakers. 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.
https://hal.inria.fr/hal-03149050
Contributor : Mathieu Besançon <>
Submitted on : Monday, February 22, 2021 - 5:16:36 PM
Last modification on : Wednesday, February 24, 2021 - 3:27:03 AM
Contributor : Mathieu Besançon <>
Submitted on : Monday, February 22, 2021 - 5:16:36 PM
Last modification on : Wednesday, February 24, 2021 - 3:27:03 AM
File
2011.00824.pdf
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution 4.0 International License