Abstract
AbstractNear-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.
Funder
NSERC Energy Storage Technologies Network
Région Hauts-de-France
Publisher
Springer Science and Business Media LLC
Reference22 articles.
1. Dempe, S.: Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, pp. 581–672. Springer (2020)
2. Besançon, M., Anjos, M.F., Brotcorne, L.: Near-optimal Robust Bilevel Optimization (2019). https://arxiv.org/abs/1908.04040
3. Dempe, S., Kalashnikov, V., Pérez-Valdés, G.A., Kalashnykova, N.: Bilevel programming problems. Energy Systems. Springer, Berlin (2015)
4. Wiesemann, W., Tsoukalas, A., Kleniati, P.-M., Rustem, B.: Pessimistic bilevel optimization. SIAM J. Optim. 23, 353–380 (2013)
5. Audet, C., Hansen, P., Jaumard, B., Savard, G.: Links between linear bilevel and mixed 0–1 programming problems. J. Optim. Theory Appl. 93(2), 273–300 (1997)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献