Outer approximation for global optimization of mixed-integer quadratic bilevel problems
From MaRDI portal
Publication:2044965
DOI10.1007/s10107-020-01601-2zbMath1473.90107OpenAlexW3126901467MaRDI QIDQ2044965
Martin Schmidt, Thomas Kleinert, Veronika Grimm
Publication date: 11 August 2021
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-020-01601-2
quadratic programmingouter approximationbilevel optimizationconvex mixed-integer nonlinear optimization
Convex programming (90C25) Mixed integer programming (90C11) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Related Items
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs, Benders Subproblem Decomposition for Bilevel Problems with Convex Follower, A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities, Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection, A survey on mixed-integer programming techniques in bilevel optimization, On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level, The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Neural network for solving convex quadratic bilevel programming problems
- The EU regulation on cross-border trade of electricity: a two-stage equilibrium model
- An algorithmic framework for convex mixed integer nonlinear programs
- A neural network for solving a convex quadratic bilevel programming problem
- Convex two-level optimization
- Descent approaches for quadratic bilevel programming
- Solving mixed integer nonlinear programs by outer approximation
- Foundations of bilevel programming
- Nonconvex equilibrium models for gas market analysis: failure of standard techniques and alternative modeling approaches
- A note on linearized reformulations for a class of bilevel linear integer problems
- A dynamic reformulation heuristic for generalized interdiction problems
- Bilevel road pricing: theoretical analysis and optimality conditions
- On the use of intersection cuts for bilevel optimization
- Global optimization of multilevel electricity market models including network design and graph partitioning
- The impact of neighboring markets on renewable locations, transmission expansion, and generation investment
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- A multilevel model of the European entry-exit gas market
- Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems
- A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- Bilevel Knapsack with Interdiction Constraints
- The Cutting-Plane Method for Solving Convex Programs
- Using EPECs to Model Bilevel Games in Restructured Electricity Markets with Locational Prices
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- The polynomial hierarchy and a simple model for competitive analysis
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- New Branch-and-Bound Rules for Linear Bilevel Programming
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
- Multilevel Approaches for the Critical Node Problem
- 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 Problems
- The Mixed Integer Linear Bilevel Programming Problem
- Mixed-integer nonlinear optimization
- Linear programming. Foundations and extensions
- Benchmarking optimization software with performance profiles.
