A survey on mixed-integer programming techniques in bilevel optimization
From MaRDI portal
Publication:6114905
DOI10.1016/j.ejco.2021.100007MaRDI QIDQ6114905
Martin Schmidt, Martine Labbé, Thomas Kleinert, Ivana Ljubić
Publication date: 12 July 2023
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Hierarchical games (including Stackelberg games) (91A65) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Operations research and management science (90Bxx)
Related Items (28)
A generic optimization framework for resilient systems ⋮ A bilevel optimization approach to decide the feasibility of bookings in the European gas market ⋮ SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs ⋮ Integer programming methods for solving binary interdiction games ⋮ Solution techniques for bi-level knapsack problems ⋮ A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities ⋮ Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem ⋮ On the complexity of the bilevel minimum spanning tree problem ⋮ Metaheuristics for bilevel optimization: a comprehensive review ⋮ Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem ⋮ Shortest path interdiction problem with convex piecewise-linear costs ⋮ Exploiting the polyhedral geometry of stochastic linear bilevel programming ⋮ A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints ⋮ A survey on bilevel optimization under uncertainty ⋮ Setting closer targets based on non-dominated convex combinations of Pareto-efficient units: a bi-level linear programming approach in data envelopment analysis ⋮ Using neural networks to solve linear bilevel problems with unknown lower level ⋮ On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level ⋮ An exact method for binary fortification games ⋮ Mathematical programming formulations for the collapsed k-core problem ⋮ Robust capacitated Steiner trees and networks with uniform demands ⋮ Rejection-proof mechanisms for multi-agent kidney exchange ⋮ Min–max optimization of node‐targeted attacks in service networks ⋮ Complexity of near-optimal robust versions of multilevel optimization problems ⋮ Solving certain complementarity problems in power markets via convex programming ⋮ An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities ⋮ On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints ⋮ A framework for generalized Benders' decomposition and its application to multilevel optimization ⋮ Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy
Cites Work
- An SOS1-based approach for solving MPECs with a natural gas market application
- Minimum edge blocker dominating set problem
- Transmission and generation investment in electricity markets: the effects of market splitting and network fee regimes
- A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game
- A class of algorithms for mixed-integer bilevel min-max optimization
- A trilevel programming approach for electric grid defense planning
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Efficient heuristic algorithms for maximum utility product pricing problems
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- Bilevel programming and the separation problem
- Minimum \(d\)-blockers and \(d\)-transversals in graphs
- The most vital nodes with respect to independent set and vertex cover
- An exact algorithm for the network pricing problem
- 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
- Enhanced exact algorithms for discrete bilevel linear problems
- Maximum utility product pricing models and algorithms based on reservation price
- Matching interdiction
- Robust solutions to Stackelberg games: addressing bounded rationality and limited observations in human cognition
- The Stackelberg minimum spanning tree game
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Valid inequalities and branch-and-cut for the clique pricing problem
- 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
- The multi-terminal maximum-flow network-interdiction problem
- Efficiently solving linear bilevel programming problems using off-the-shelf optimization software
- Construction of a real-world bilevel linear programming model of the highway network design problem
- Bilevel programming: a survey
- Minimum cost edge blocker clique problem
- Linear bilevel programming with upper level constraints depending on the lower level solution
- Some properties of the bilevel programming problem
- New formulations and valid inequalities for a bilevel pricing problem
- A note on the definition of a linear bilevel programming solution
- An algorithmic framework for convex mixed integer nonlinear programs
- Detecting critical nodes in sparse graphs
- Global solution of bilevel programs with a nonconvex inner program
- Blockers and transversals
- Convex two-level optimization
- Partitioning procedures for solving mixed-variables programming problems
- Hierarchical optimization: An introduction
- The most vital edges in the minimum spanning tree problem
- Practical bilevel optimization. Algorithms and applications
- Descent approaches for quadratic bilevel programming
- Solving mixed integer nonlinear programs by outer approximation
- Bilevel and multilevel programming: A bibliography review
- Links between linear bilevel and mixed 0-1 programming problems
- Linear bilevel problems: genericity results and an efficient method for computing local minima
- Solving linear fractional bilevel programs.
- A bilevel programming approach to determining tax credits for biofuel production
- A note on a penalty function approach for solving bilevel linear programs
- Foundations of bilevel programming
- Solving discrete linear bilevel optimization problems using the optimal value reformulation
- A note on linearized reformulations for a class of bilevel linear integer problems
- The maximum clique interdiction problem
- The critical node detection problem in networks: a survey
- The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
- On the use of intersection cuts for bilevel optimization
- Deterministic network interdiction
- The bilevel linear/linear fractional programming problem
- Finding the most vital arcs in a network
- Bilevel programming in traffic planning: Models, methods and challenge
- Discrete linear bilevel programming problem
- Propositional truth maintenance systems: Classification and complexity analysis
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Global solution of nonlinear mixed-integer bilevel programs
- A study of general and security Stackelberg game formulations
- Global optimization of multilevel electricity market models including network design and graph partitioning
- A branch-and-cut algorithm for the edge interdiction clique problem
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems
- The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
- Portfolio problems with two levels decision-makers: optimal portfolio selection with pricing decisions on transaction costs
- Computing locally optimal solutions of the Bilevel Optimization problem using the KKT approach
- On integer and bilevel formulations for the \(k\)-vertex cut problem
- Flying safely by bilevel programming
- Mixed-integer bilevel representability
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- Complexity of near-optimal robust versions of multilevel optimization problems
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Algorithms and applications for a class of bilevel MILPs
- Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints
- A survey of network interdiction models and algorithms
- Joint location and pricing within a user-optimized environment
- A trilevel model for best response in energy demand-side management
- Bilevel linear programming
- A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
- A multilevel model of the European entry-exit gas market
- A bilevel mixed-integer program for critical infrastructure protection planning
- Disjunctive cuts for continuous linear bilevel programming
- Parametric global optimisation for bilevel programming
- New branch-and-Cut algorithm for bilevel linear programming
- Bilevel optimization applied to strategic pricing in competitive electricity markets
- An overview of bilevel optimization
- An overview of Stackelberg pricing in networks
- Boundedness relations for linear constraint sets
- Generalized Benders decomposition
- A note on the Pareto optimality of solutions to the linear bilevel programming problem
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Scheduling with Deadlines and Loss Functions
- Stochastic Network Interdiction
- A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem
- A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
- Tariff Optimization in Networks
- Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness
- A polyhedral study of the network pricing problem with connected toll arcs
- Stackelberg network pricing is hard to approximate
- Reformulation and sampling to solve a stochastic network interdiction problem
- Bilevel Knapsack with Interdiction Constraints
- Integer Programming
- A Study on the Computational Complexity of the Bilevel Knapsack Problem
- Security and Game Theory
- The Cutting-Plane Method for Solving Convex Programs
- An Automatic Method of Solving Discrete Programming Problems
- Optimality conditions for the bilevel programming problem
- Joint Design and Pricing on a Network
- Path-based formulations of a bilevel toll setting problem
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- Bilevel programming with discrete lower level problems
- The polynomial hierarchy and a simple model for competitive analysis
- Network design problem with congestion effects: A case of bilevel programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A simple algorithm for the-linear bilevel programming problem
- Remark on the Constraint Sets in Linear Programming
- 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
- Maximizing the minimum source-sink path subject to a budget constraint
- A problem in network interdiction
- A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
- Network pricing problem with unit toll
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
- Reduction of the bilevel stochastic optimization problem with quantile objective function to a mixed‐integer problem
- Two-level value function approach to non-smooth optimistic and pessimistic bilevel programs
- Minimum vertex blocker clique problem
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
- Shortest-path network interdiction
- Optimality conditions for bilevel programming problems
- Two-Person Zero-Sum Games for Network Interdiction
- Packing Interdiction and Partial Covering Problems
- Sequential Interdiction with Incomplete Information and Learning
- A Bilevel Stochastic Programming Problem with Random Parameters in the Follower’s Objective Function
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
- Multilevel Approaches for the Critical Node Problem
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
- Algorithms for Linear Bilevel Optimization
- Methods for Pessimistic Bilevel Optimization
- Bilevel Linear Optimization Under Uncertainty
- A Unified Framework for Multistage Mixed Integer Linear Optimization
- BOLIB: Bilevel Optimization LIBrary of Test Problems
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- Competitive Facility Location with Selfish Users and Queues
- 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
- Two-Level Linear Programming
- The Mixed Integer Linear Bilevel Programming Problem
- Risk-Averse Models in Bilevel Stochastic Linear Programming
- Solution of bilevel optimization problems using the KKT approach
- Pessimistic Bilevel Optimization
- An approximation algorithm for Stackelberg network pricing
- Complexity and Approximation of the Continuous Network Design Problem
- Mixed-integer nonlinear optimization
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- A Generalized Nash Solution for Two-Person Bargaining Games with Incomplete Information
- Mathematical Programs with Optimization Problems in the Constraints
- A Backward Sampling Framework for Interdiction Problems with Fortification
- A solution method for the linear static Stackelberg problem using penalty functions
- Bilevel programming and price setting problems
- Computational comparisons of different formulations for the Stackelberg minimum spanning tree game
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A survey on mixed-integer programming techniques in bilevel optimization
