Outer approximation for global optimization of mixed-integer quadratic bilevel problems
From MaRDI portal
Publication:2044965
Recommendations
- Global optimization of mixed-integer bilevel programming problems
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
- Intersection cuts for bilevel optimization
- scientific article; zbMATH DE number 970346
- Global optimization algorithm for solving bilevel programming problems with quadratic lower levels
Cites work
- A bilevel model of taxation and its application to optimal highway pricing
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- A class of algorithms for mixed-integer bilevel min-max optimization
- A dynamic reformulation heuristic for generalized interdiction problems
- A multilevel model of the European entry-exit gas market
- A neural network for solving a convex quadratic bilevel programming problem
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A note on linearized reformulations for a class of bilevel linear integer problems
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- An algorithmic framework for convex mixed integer nonlinear programs
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Benchmarking optimization software with performance profiles.
- Bilevel knapsack with interdiction constraints
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Bilevel road pricing: theoretical analysis and optimality conditions
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
- Convex two-level optimization
- Descent approaches for quadratic bilevel programming
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Foundations of bilevel programming
- Global optimization of multilevel electricity market models including network design and graph partitioning
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Linear programming. Foundations and extensions
- Mixed-integer nonlinear optimization
- Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems
- Multilevel approaches for the critical node problem
- Neural network for solving convex quadratic bilevel programming problems
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Nonconvex equilibrium models for gas market analysis: failure of standard techniques and alternative modeling approaches
- On the use of intersection cuts for bilevel optimization
- Solving mixed integer nonlinear programs by outer approximation
- Technical note -- There's no free lunch: on the hardness of choosing a correct big-M in bilevel optimization
- The Cutting-Plane Method for Solving Convex Programs
- The EU regulation on cross-border trade of electricity: a two-stage equilibrium model
- The impact of neighboring markets on renewable locations, transmission expansion, and generation investment
- The Mixed Integer Linear Bilevel Programming Problem
- The polynomial hierarchy and a simple model for competitive analysis
- Using EPECs to Model Bilevel Games in Restructured Electricity Markets with Locational Prices
Cited in
(12)- The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- Global optimization of mixed-integer bilevel programming problems
- scientific article; zbMATH DE number 5903940 (Why is no real title available?)
- Intersection cuts for bilevel optimization
- 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
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- Mixed-integer bilevel optimization with nonconvex quadratic lower-level problems: complexity and a solution method
This page was built for publication: Outer approximation for global optimization of mixed-integer quadratic bilevel problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2044965)