The Mixed Integer Linear Bilevel Programming Problem

DOI10.1287/OPRE.38.5.911MaRDI QIDQ5202044zbMATH OpenOpenAlexFDO

Authors James T. Moore, Jonathan F. Bard

Publication date 1990

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.38.5.911

zbMATH Keywords

bilevel optimizationheuristicsimplicit enumerationtwo-person, noncooperative game

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11) 2-person games (91A05) Hierarchical games (including Stackelberg games) (91A65)

Recommendations

• A value-function-based exact approach for the bilevel mixed-integer programming problem
• scientific article; zbMATH DE number 35514
• An algorithm for the mixed-integer nonlinear bilevel programming problem
• A class of algorithms for mixed-integer bilevel min-max optimization
• A class of integer linear fractional bilevel programming problems

Cited in

(only showing first 100 items - show all)

• Global solution of bilevel programs with a nonconvex inner program
• An algorithm for the mixed-integer nonlinear bilevel programming problem
• A global optimization approach for the linear two-level program
• A simple tabu search method to solve the mixed-integer linear bilevel programming problem
• On the quasiconcave bilevel programming problem
• A quasiconcave minimization method for solving linear two-level programs
• Nonlinear integer bilevel programming
• Bilevel and multilevel programming: A bibliography review
• A bilevel bottleneck programming problem
• Interactive fuzzy programming for multi-level 0-1 programming problems with fuzzy parameters through genetic algorithms
• Multilevel decision-making: a survey
• Integer programming formulations for three sequential discrete competitive location problems with foresight
• Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches
• On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory
• Approximation of the competitive facility location problem with MIPs
• A single-level reformulation of mixed integer bilevel programming problems
• Feature selection for classification models via bilevel optimization
• Radio communications interdiction problem under deterministic and probabilistic jamming
• A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
• Optimal sensor deployment to increase the security of the maximal breach path in border surveillance
• A dynamic reformulation heuristic for generalized interdiction problems
• On a class of bilevel linear mixed-integer programs in adversarial settings
• Incorporating the threat of terrorist attacks in the design of public service facility networks
• A leader-follower game in competitive facility location
• A bilevel fixed charge location model for facilities under imminent attack
• Discrete bilevel programming: application to a natural gas cash-out problem
• On the use of intersection cuts for bilevel optimization
• Discrete linear bilevel programming problem
• The stochastic interdiction median problem with disruption intensity levels
• An exact algorithm for bilevel 0-1 knapsack problems
• Global solution of nonlinear mixed-integer bilevel programs
• Global optimization of multilevel electricity market models including network design and graph partitioning
• A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem
• An enhanced branch-and-bound algorithm for bilevel integer linear programming
• 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 minimax regret model for the leader-follower facility location problem
• Tri-level mixed-binary linear programming: solution approaches and application in defending critical infrastructure
• 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
• A bilevel optimization approach to decide the feasibility of bookings in the European gas market
• 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
• 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
• The bilevel optimisation of a multi-agent project scheduling and staffing problem
• Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks
• A bi-level model and memetic algorithm for arc interdiction location-routing problem
• Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities
• Resolution method for mixed integer bi-level linear problems based on decomposition technique
• Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
• Algorithms and applications for a class of bilevel MILPs
• An exact algorithm for solving the bilevel facility interdiction and fortification problem
• Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems
• A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
• The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
• A bilevel mixed-integer program for critical infrastructure protection planning
• Production planning problem with sequence dependent setups as a bilevel programming problem
• An exact solution approach for the interdiction median problem with fortification
• An aspect of bilevel fixed charge fractional transportation problem
• A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection
• Exact solution approaches for a class of bilevel fractional programs
• An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems
• Solving mixed integer bilinear problems using MILP formulations
• Mixed integer parametric bilevel programming for optimal strategic bidding of energy producers in day-ahead electricity markets with indivisibilities
• On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions
• Lagrangean relaxation-based algorithm for bi-level problems
• Solving discretely-constrained Nash-Cournot games with an application to power markets
• A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings
• Intersection cuts for bilevel optimization
• Bilevel knapsack with interdiction constraints
• A class of algorithms for mixed-integer bilevel min-max optimization
• An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
• A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
• COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL INTEGER PROGRAMMING PROBLEMS
• A bi-level programming model for protection of hierarchical facilities under imminent attacks
• Bilevel programming with discrete lower level problems
• Bilevel programming and the separation problem
• The Linear-Quadratic Bilevel Programming Problem
• Optimizing system resilience: a facility protection model with recovery time
• scientific article; zbMATH DE number 1163112 (Why is no real title available?)
• Multistage bilevel programming problems
• A value-function-based exact approach for the bilevel mixed-integer programming problem
• On bilevel fractional programming
• AN ITERATIVE ALGORITHM FOR A CLASS OF NONLINEAR INTEGER BILEVEL PROGRAMMING PROBLEMS WITH BOX CONSTRAINTS
• A cut generation algorithm of finding an optimal solution in a market competition
• 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
• Enhanced exact algorithms for discrete bilevel linear problems
• MPEC methods for bilevel optimization problems
• A unified framework for multistage mixed integer linear optimization
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Core pricing in combinatorial exchanges with financially constrained buyers: computational hardness and algorithmic solutions
• 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
• A bilevel “Attacker–Defender” model to choosing the composition of attack means

This page was built for publication: The Mixed Integer Linear Bilevel Programming Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202044)