Near-optimal robust bilevel optimization - Archive ouverte HAL
Preprints, Working Papers, ... Year : 2019

Near-optimal robust bilevel optimization

Abstract

Bilevel optimization problems embed the optimality conditions of a sub-problem into the constraints of another optimization problem. We introduce the concept of near-optimality robustness for bilevel problems, protecting the upper-level solution feasibility from limited deviations at the lower level. General properties and necessary conditions for the existence of solutions are derived for near-optimal robust versions of generic bilevel problems. A duality-based solution method is defined when the lower level is convex, leveraging the methodology from the robust and bilevel literature. Numerical results assess the efficiency of the proposed algorithm and the impact of valid inequalities on the solution time.
Fichier principal
Vignette du fichier
1908.04040.pdf (966.38 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02414848 , version 1 (16-12-2019)
hal-02414848 , version 2 (03-01-2021)

Licence

Identifiers

Cite

Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne. Near-optimal robust bilevel optimization. 2019. ⟨hal-02414848v2⟩
244 View
367 Download

Altmetric

Share

More