Closing the Gap in Linear Bilevel Optimization: A New Valid Primal-Dual Inequality - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Optimization Letters Year : 2021

Closing the Gap in Linear Bilevel Optimization: A New Valid Primal-Dual Inequality

Abstract

Linear bilevel optimization problems are often tackled by replacing the linear lower-level problem with its Karush-Kuhn-Tucker (KKT) conditions. The resulting single-level problem can be solved in a branch-and-bound fashion by branching on the complementarity constraints of the lower-level problem's optimality conditions. While in mixed-integer single-level optimization branch-and-cut has proven to be a powerful extension of branch-and-bound, in linear bilevel optimization not too many bilevel-tailored valid inequalities exist. In this paper, we briefly review existing cuts for linear bilevel problems and introduce a new valid inequality that exploits the strong duality condition of the lower level. We further discuss strengthened variants of the inequality that can be derived from McCormick envelopes. In a computational study, we show that the new valid inequalities can help to close the optimality gap very effectively on a large test set of linear bilevel instances.
Fichier principal
Vignette du fichier
PreprintVersion-2020-09-16.pdf (593.6 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02889276 , version 1 (03-07-2020)
hal-02889276 , version 2 (16-09-2020)

Identifiers

Cite

Thomas Kleinert, Martine Labbé, Fränk Plein, Martin Schmidt. Closing the Gap in Linear Bilevel Optimization: A New Valid Primal-Dual Inequality. Optimization Letters, 2021, ⟨10.1007/s11590-020-01660-6⟩. ⟨hal-02889276v2⟩
254 View
295 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More