Why there is no need to use a big-\(M\) in linear bilevel optimization: a computational study of two ready-to-use approaches
From MaRDI portal
Publication:6088759
DOI10.1007/s10287-023-00435-5OpenAlexW4319349207MaRDI QIDQ6088759
Martin Schmidt, Thomas Kleinert
Publication date: 14 December 2023
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-023-00435-5
Mixed integer programming (90C11) Optimality conditions and duality in mathematical programming (90C46) Mathematical programming (90Cxx) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Operations research and management science (90Bxx)
Cites Work
- An SOS1-based approach for solving MPECs with a natural gas market application
- A class of algorithms for mixed-integer bilevel min-max optimization
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Efficiently solving linear bilevel programming problems using off-the-shelf optimization software
- Foundations of bilevel programming
- A dynamic reformulation heuristic for generalized interdiction problems
- A leader-followers model of power transmission capacity expansion in a market driven environment
- Global optimization of multilevel electricity market models including network design and graph partitioning
- The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling
- Solving certain complementarity problems in power markets via convex programming
- Electricity market clearing with improved scheduling of stochastic production
- 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
- Benchmarking optimization software with performance profiles.
