A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
From MaRDI portal
(Redirected from Publication:670656)
Abstract: We propose an extended variant of the reformulation and decomposition algorithm for solving a special class of mixed-integer bilevel linear programs (MIBLPs) where continuous and integer variables are involved in both upper- and lower-level problems. In particular, we consider MIBLPs with upper-level constraints that involve lower-level variables. We assume that the inducible region is nonempty and all variables are bounded. By using the reformulation and decomposition scheme, an MIBLP is first converted into its equivalent single-level formulation, then computed by a column-and-constraint generation based decomposition algorithm. The solution procedure is enhanced by a projection strategy that does not require the relatively complete response property. To ensure its performance, we prove that our new method converges to the global optimal solution in a finite number of iterations. A large-scale computational study on random instances and instances of hierarchical supply chain planning are presented to demonstrate the effectiveness of the algorithm.
Recommendations
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
- Global optimization of mixed-integer bilevel programming problems
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- scientific article; zbMATH DE number 970346
- A duality based approach for a class of bilevel programming problems
Cites work
- scientific article; zbMATH DE number 35514 (Why is no real title available?)
- scientific article; zbMATH DE number 7005721 (Why is no real title available?)
- A class of algorithms for mixed-integer bilevel min-max optimization
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A nonconvex max-min problem
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- Adjustable robust optimization models for a nonlinear two-period system
- Algorithms for solving the mixed integer two-level linear programming problem
- An algorithm for the mixed-integer nonlinear bilevel programming problem
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Bilevel and multilevel programming: A bibliography review
- Bilevel programming and the separation problem
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
- Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches
- Complementarity problems in GAMS and the PATH solver
- Discrete linear bilevel programming problem
- Double penalty method for bilevel optimization problems
- Foundations of bilevel programming
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Global optimization of mixed-integer bilevel programming problems
- Global solution of bilevel programs with a nonconvex inner program
- Global solution of nonlinear mixed-integer bilevel programs
- Global solution of semi-infinite programs
- Infinitely constrained optimization problems
- Intersection cuts for bilevel optimization
- Linear bilevel programming with upper level constraints depending on the lower level solution
- Links between linear bilevel and mixed 0-1 programming problems
- Mathematical Programs with Optimization Problems in the Constraints
- Metaheuristics for bi-level optimization
- New formulations and valid inequalities for a bilevel pricing problem
- New product introduction against a predator: a bilevel mixed-integer programming approach
- On generalized semi-infinite optimization and bilevel optimization
- On linear programs with linear complementarity constraints
- Parametric global optimisation for bilevel programming
- Parametric integer programming algorithm for bilevel mixed integer programs
- Pessimistic bilevel optimization
- Practical bilevel optimization. Algorithms and applications
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Solving minimax problems by interval methods
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- The Mixed Integer Linear Bilevel Programming Problem
- The nonlinear bilevel programming problem:formulations,regularity and optimality conditions
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
Cited in
(24)- An exact method for binary fortification games
- An exact solution algorithm for integer bilevel programming with application in energy market optimization
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities
- Interdicting restructuring networks with applications in illicit trafficking
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023
- Branch-and-cut solution approach for multilevel mixed integer linear programming problems
- An enhanced branch-and-bound algorithm for bilevel integer linear programming
- A single-level reformulation of mixed integer bilevel programming problems
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- Managing Product Transitions: A Bilevel Programming Approach
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
- Mixed-integer bilevel representability
- A survey on mixed-integer programming techniques in bilevel optimization
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Bilevel Integer Programs with Stochastic Right-Hand Sides
- A framework for generalized Benders' decomposition and its application to multilevel optimization
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Bilevel optimization for joint scheduling of production and energy systems
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
This page was built for publication: A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670656)
