Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
From MaRDI portal
Publication:2039060
DOI10.1007/s11590-020-01660-6zbMath1470.90057OpenAlexW3038794973MaRDI QIDQ2039060
Martin Schmidt, Martine Labbé, Thomas Kleinert, Fränk Plein
Publication date: 8 July 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01660-6
Mixed integer programming (90C11) Optimality conditions and duality in mathematical programming (90C46) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (5)
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective ⋮ Integer programming methods for solving binary interdiction games ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ Presolving linear bilevel optimization problems ⋮ Detecting and solving aircraft conflicts using bilevel programming
Cites Work
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Descent approaches for quadratic bilevel programming
- Foundations of bilevel programming
- A note on linearized reformulations for a class of bilevel linear integer problems
- A dynamic reformulation heuristic for generalized interdiction problems
- A multilevel model of the European entry-exit gas market
- Disjunctive cuts for continuous linear bilevel programming
- New branch-and-Cut algorithm for bilevel linear programming
- A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
- Bilevel Knapsack with Interdiction Constraints
- Using EPECs to Model Bilevel Games in Restructured Electricity Markets with Locational Prices
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization
- Bilevel programming and price setting problems
- Benchmarking optimization software with performance profiles.
This page was built for publication: Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
