Computational linear bilevel optimization

DOI10.1007/978-3-031-24907-5_2MaRDI QIDQ6606514FDOQ6606514

Authors: Thomas Kleinert 

Publication date: 17 September 2024

Recommendations

• Why there is no need to use a big-\(M\) in linear bilevel optimization: a computational study of two ready-to-use approaches
• Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
• Technical note -- There's no free lunch: on the hardness of choosing a correct big-\(M\) in bilevel optimization
• A note on linearized reformulations for a class of bilevel linear integer problems
• A new general-purpose algorithm for mixed-integer bilevel linear programs

zbMATH Keywords

bilevel optimizationcomputational optimizationmixed-integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cites Work

• New Branch-and-Bound Rules for Linear Bilevel Programming
• A Representation and Economic Interpretation of a Two-Level Programming Problem
• Technical note -- There's no free lunch: on the hardness of choosing a correct big-\(M\) in bilevel optimization
• Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
• Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
• Computing locally optimal solutions of the Bilevel Optimization problem using the KKT approach

Cited In (1)

• Why there is no need to use a big-\(M\) in linear bilevel optimization: a computational study of two ready-to-use approaches

This page was built for publication: Computational linear bilevel optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606514)