Back to Search
Start Over
Complexity of near-optimal robust versions of multilevel optimization problems
- Publication Year :
- 2020
-
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 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.
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2011.00824
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.1007/s11590-021-01754-9