A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem

DOI10.1287/opre.2017.1589zbMath1387.90161OpenAlexW2605397371MaRDI QIDQ4604908

J. Cole Smith, Leonardo Lozano

Publication date: 6 March 2018

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/421ee409dd06d3656b1fccadc1ffb20d170facd9

zbMATH Keywords

integer programmingschedulingnonlinear programmingbilevel optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items

A generic optimization framework for resilient systems, Bilevel optimization to deal with demand response in power grids: models, methods and challenges, A Branch-and-Cut Algorithm for Submodular Interdiction Games, Managing Product Transitions: A Bilevel Programming Approach, Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments, SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs, Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets, Bilevel Integer Programs with Stochastic Right-Hand Sides, A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games, Benders Subproblem Decomposition for Bilevel Problems with Convex Follower, A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences, A value function-based approach for robust surgery planning, Solution techniques for bi-level knapsack problems, Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem, Using neural networks to solve linear bilevel problems with unknown lower level, Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds, An exact solution algorithm for integer bilevel programming with application in energy market optimization, Interdicting restructuring networks with applications in illicit trafficking, A survey on mixed-integer programming techniques in bilevel optimization, A deterministic bounding algorithm vs. a hybrid meta-heuristic to deal with a bilevel mixed-integer nonlinear optimization model for electricity dynamic pricing, Rejection-proof mechanisms for multi-agent kidney exchange, Mixed-integer bilevel representability, A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation, Interdiction Games and Monotonicity, with Application to Knapsack Problems, Feature selection for classification models via bilevel optimization, The maximum clique interdiction problem, A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs, Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks, Integrating link-based discrete credit charging scheme into discrete network design problem, Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities, A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem, The impact of neighboring markets on renewable locations, transmission expansion, and generation investment, An enhanced branch-and-bound algorithm for bilevel integer linear programming, A survey of network interdiction models and algorithms, 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, A Gilmore-Gomory construction of integer programming value functions, A framework for generalized Benders' decomposition and its application to multilevel optimization, Methods for Pessimistic Bilevel Optimization, A Unified Framework for Multistage Mixed Integer Linear Optimization, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Uses Software

• Optknock

Cites Work

• Unnamed Item
• On the solution of convex bilevel optimization problems
• An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
• Natural gas bilevel cash-out problem: convergence of a penalty function method
• Parametric integer programming algorithm for bilevel mixed integer programs
• A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
• An extended branch and bound algorithm for linear bilevel programming
• Global solution of bilevel programs with a nonconvex inner program
• A global optimization approach for the linear two-level program
• A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
• Bilevel road pricing: theoretical analysis and optimality conditions
• An extended Kuhn-Tucker approach for linear bilevel programming
• Discrete bilevel programming: application to a natural gas cash-out problem
• Deterministic network interdiction
• Bilevel programming in traffic planning: Models, methods and challenge
• The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
• Global solution of nonlinear mixed-integer bilevel programs
• Robust counterparts of inequalities containing sums of maxima of linear functions
• Resolution method for mixed integer bi-level linear problems based on decomposition technique
• Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
• A linearization approach to solve the natural gas cash-out bilevel problem
• Parametric global optimisation for bilevel programming
• A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
• An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
• Bilevel programming with discrete lower level problems
• New Branch-and-Bound Rules for Linear Bilevel Programming
• A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
• Shortest-path network interdiction
• Optimality conditions for bilevel programming problems
• Necessary optimality conditions in pessimistic bilevel programming
• Bilevel Programming Problems
• The Mixed Integer Linear Bilevel Programming Problem
• KKT Reformulation and Necessary Conditions for Optimality in Nonsmooth Bilevel Optimization
• Pessimistic Bilevel Optimization
• Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
• New necessary optimality conditions in optimistic bilevel programming
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Canonical Cuts on the Unit Hypercube
• A Backward Sampling Framework for Interdiction Problems with Fortification