An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
From MaRDI portal
Publication:2089867
DOI10.1007/s10898-022-01172-wzbMath1505.90084OpenAlexW4283650760MaRDI QIDQ2089867
Dieter Weninger, Maximilian Merkert, Galina Orlinskaya
Publication date: 24 October 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01172-w
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Hierarchical games (including Stackelberg games) (91A65) Optimality conditions and duality in mathematical programming (90C46)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality for mixed-integer convex minimization
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- On interval-subgradient and no-good cuts
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- Parametric integer programming algorithm for bilevel mixed integer programs
- Construction of a real-world bilevel linear programming model of the highway network design problem
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- Towards global bilevel dynamic optimization
- Global solution of bilevel programs with a nonconvex inner program
- A multi-parametric programming approach for multilevel hierarchical and decentralised optimisation problems
- Practical bilevel optimization. Algorithms and applications
- Logic-based Benders decomposition
- Foundations of bilevel programming
- Solving discrete linear bilevel optimization problems using the optimal value reformulation
- Integer programming as projection
- An exact solution method for binary equilibrium problems with compensation and the power market uplift problem
- On the use of intersection cuts for bilevel optimization
- Discrete linear bilevel programming problem
- Global solution of nonlinear mixed-integer bilevel programs
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- On mathematical programming with indicator constraints
- On handling indicator constraints in mixed integer programming
- Parametric global optimisation for bilevel programming
- Solving network design problems via iterative aggregation
- A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
- Intersection Cuts for Bilevel Optimization
- A duality theorem for non-linear programming
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization
- Bilevel Programming Problems
- Pessimistic Bilevel Optimization
- Bilevel programming and price setting problems
- A survey on mixed-integer programming techniques in bilevel optimization
This page was built for publication: An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
