2020
DOI: 10.1007/s11590-020-01660-6
|View full text |Cite
|
Sign up to set email alerts
|

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 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 inequal… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
2
2

Relationship

2
8

Authors

Journals

citations
Cited by 19 publications
(13 citation statements)
references
References 24 publications
0
13
0
Order By: Relevance
“…Note that these inequalities can be seen as a special case of the valid inequalities discussed in [14] for bilevel optimization.…”
Section: Valid Inequalitiesmentioning
confidence: 99%
“…Note that these inequalities can be seen as a special case of the valid inequalities discussed in [14] for bilevel optimization.…”
Section: Valid Inequalitiesmentioning
confidence: 99%
“…This reformulation is practical for solving bilevel problems, but the choice of the big‐ M term should be applied with care. Checking big‐ M term validity can be as difficult as solving the original bilevel problem (Kleinert et al., 2020, 2021), and if the choice of big‐ M term is too small it can result in suboptimal solutions of the bilevel problem (Pineda and Morales, 2019).…”
Section: Bilevel Optimizationmentioning
confidence: 99%
“…However, this approach may require a substantial amount of branching on complementary conditions which may be impractical on large problems. Recently, Kleinert et al (2020a) derived valid inequalities for LBP by exploiting the SD conditions of the follower-level problem, which proves to be very effective in closing the gap for some instances.…”
Section: Solution Approaches Of Bilevel Programming Problemmentioning
confidence: 99%