New Branch-and-Bound Rules for Linear Bilevel Programming
From MaRDI portal
Publication:4021697
DOI10.1137/0913069zbMATH Open0760.65063OpenAlexW2079104779MaRDI QIDQ4021697FDOQ4021697
Authors: Pierre Hansen, Brigitte Jaumard, Gilles Savard 
Publication date: 16 January 1993
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0913069
Recommendations
decision theoryStackelberg gamecomputational resultsvariable eliminationlinear bilevel programmingmultiple decisiondepth-first branch and bound algorithm
Numerical mathematical programming methods (65K05) Management decision making, including multiple objectives (90B50) Decision theory (91B06) Combinatorial optimization (90C27) Decision theory for games (91A35)
Cited In (only showing first 100 items - show all)
- Optimal affine leader functions in reverse Stackelberg games. Existence conditions and characterization
- Solving linear programs with complementarity constraints using branch-and-cut
- A pivoting algorithm for linear programming with linear complementarity constraints
- Solving quadratic convex bilevel programming problems using a smoothing method
- Bilevel model for production-distribution planning solved by using ant colony optimization
- A hybrid tabu-ascent algorithm for the linear bilevel programming problem
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- Solving bilevel linear programs using multiple objective linear programming
- A genetic algorithm for solving linear fractional bilevel problems
- A branch-and-bound multi-parametric programming approach for non-convex multilevel optimization with polyhedral constraints
- An extended \(K\)th-best approach for linear bilevel programming
- Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice
- Linear bilevel programs with multiple objectives at the upper level
- Stackelberg solutions for fuzzy random two-level linear programming through probability maximization with possibility
- COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL INTEGER PROGRAMMING PROBLEMS
- Linear bilevel programming with interval coefficients
- On the quasiconcave bilevel programming problem
- The steepest descent direction for the nonlinear bilevel programming problem
- AN EXTENDED BRANCH AND BOUND ALGORITHM FOR BILEVEL MULTI-FOLLOWER DECISION MAKING IN A REFERENTIAL-UNCOOPERATIVE SITUATION
- Bilevel and multilevel programming: A bibliography review
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
- A method for solving bilevel linear programming problems
- FUZZY BILEVEL PROGRAMMING: MULTI-OBJECTIVE AND MULTI-FOLLOWER WITH SHARED VARIABLES
- A bilevel programming approach to determining tax credits for biofuel production
- The computational complexity of bilevel assignment problems
- Links between linear bilevel and mixed 0-1 programming problems
- An extended branch and bound algorithm for linear bilevel programming
- Stackelberg solutions for fuzzy random two-level linear programming through level sets and fractile criterion optimization
- Bilevel programming in traffic planning: Models, methods and challenge
- A simplex approach for finding local solutions of a linear bilevel program by equilibrium points
- Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm
- Discrete bilevel programming: application to a natural gas cash-out problem
- Linear bilevel programming solution by genetic algorithm
- A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings
- Joint optimization for coordinated configuration of product families and supply chains by a leader-follower Stackelberg game
- Mixed network design using hybrid scatter search
- An extended Kuhn-Tucker approach for linear bilevel programming
- Stackelberg solutions for fuzzy random bilevel linear programming through level sets and probability maximization
- The nonlinear bilevel programming problem:formulations,regularity and optimality conditions
- A quasiconcave minimization method for solving linear two-level programs
- Optimizing dynamic investment decisions for railway systems protection
- A computational study for bilevel quadratic programs using semidefinite relaxations
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- A novel approach to bilevel nonlinear programming
- A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
- A bilevel mixed-integer program for critical infrastructure protection planning
- A note on the definition of a linear bilevel programming solution
- An overview of bilevel optimization
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
- 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 trust region algorithm for nonlinear bilevel programming
- Determining optimal pollution control policies: An application of bilevel programming
- Bilevel programming and price setting problems
- Hazmats transportation network design model with emergency response under complex fuzzy environment
- New branch-and-Cut algorithm for bilevel linear programming
- On a bi-level formulation to protect uncapacitated \(p\)-median systems with facility recovery time and frequent disruptions
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
- The eigenvalue complementarity problem
- Parametric global optimisation for bilevel programming
- Military system of systems architecting with individual system contracts
- An Improved Unconstrained Approach for Bilevel Optimization
- Efficiently solving linear bilevel programming problems using off-the-shelf optimization software
- Descent approaches for quadratic bilevel programming
- Presolving linear bilevel optimization problems
- Stochastic mathematical programs with equilibrium constraints
- Systematic evolutionary algorithm for general multilevel Stackelberg problems with bounded decision variables (SEAMSP)
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A solution to bi/tri-level programming problems using particle swarm optimization
- Bilevel Integer Programs with Stochastic Right-Hand Sides
- Interactive fuzzy random two-level linear programming through fractile criterion optimization
- A dynamic reformulation heuristic for generalized interdiction problems
- A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
- Discrete linear bilevel programming problem
- Algorithms for linear programming with linear complementarity constraints
- Fuzzy multiple level programming
- A stone resource assignment model under the fuzzy environment
- An exact solution approach for the interdiction median problem with fortification
- A bilevel programming problem with maximization of a supermodular function in the lower level
- Disjunctive cuts for continuous linear bilevel programming
- A bilevel optimization approach to decide the feasibility of bookings in the European gas market
- An approximation scheme for a bilevel knapsack problem
- Using neural networks to solve linear bilevel problems with unknown lower level
- First-order penalty methods for bilevel optimization
- Min-max regret robust optimization approach on interval data uncertainty
- On topology optimization and canonical duality method
- Partial inverse maximum spanning tree problem under the Chebyshev norm
- A new descent algorithm for solving quadratic bilevel programming problems.
- Integrated recycling-integrated production-distribution planning for decentralized closed-loop supply chain
- A differential evolution with two mutation strategies and a selection based on an improved constraint-handling technique for bilevel programming problems
- On complexity of finding strong-weak solutions in bilevel linear programming
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
- Fuzzy bilevel programming with multiple objectives and cooperative multiple followers
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
- Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides
- The bilevel knapsack problem with stochastic right-hand sides
- A bi-level model to estimate the US air travel demand
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
This page was built for publication: New Branch-and-Bound Rules for Linear Bilevel Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4021697)
