Mathieu Besançon, Miguel F. Anjos
and Luce Brotcorne
Article (2021)
 Open Acess document in PolyPublie and at official publisher |
|
Open Access to the full text of this document Published Version Terms of Use: Creative Commons Attribution Download (198kB) |
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.
Uncontrolled Keywords
| Department: | Department of Computer Engineering and Software Engineering |
|---|---|
| Funders: | Mermoz scholarship, Centre National de la Recherche Scientifique (CNRS) - Groupement de recherche - Recherche opérationnelle |
| PolyPublie URL: | https://publications.polymtl.ca/9261/ |
| Journal Title: | Optimization Letters (vol. 15, no. 8) |
| Publisher: | Springer Nature |
| DOI: | 10.1007/s11590-021-01754-9 |
| Official URL: | https://doi.org/10.1007/s11590-021-01754-9 |
| Date Deposited: | 19 Jan 2022 17:09 |
| Last Modified: | 10 Jan 2026 18:41 |
| Cite in APA 7: | Besançon, M., Anjos, M. F., & Brotcorne, L. (2021). Complexity of near-optimal robust versions of multilevel optimization problems. Optimization Letters, 15(8), 2597-2610. https://doi.org/10.1007/s11590-021-01754-9 |
|---|---|
Statistics
Total downloads
Downloads per month in the last year
Origin of downloads
Dimensions
Repository Staff Only
|
View Item |
