A Branch and Bound Algorithm for the Bilevel Programming Problem

DOI10.1137/0911017MaRDI QIDQ3481170zbMATH OpenOpenAlexFDO

Authors Jonathan F. Bard, James T. Moore

Publication date 1990

Published in SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0911017

zbMATH Keywords

bilevel programming problembranch and bound schemecomplementary slackness conditionsstatic Stackelberg game

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 35514
• New Branch-and-Bound Rules for Linear Bilevel Programming
• A computational study of global algorithms for linear bilevel programming
• An algorithm for the mixed-integer nonlinear bilevel programming problem
• scientific article; zbMATH DE number 1163112

Cited in

(only showing first 100 items - show all)

• Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms
• Hierarchical optimization: An introduction
• A sequential LCP method for bilevel linear programming
• An algorithm for the mixed-integer nonlinear bilevel programming problem
• A modified simplex approach for solving bilevel linear programming problems
• New operations research and artificial intelligence approaches to traffic engineering problems
• On the quasiconcave bilevel programming problem
• A penalty function approach for solving bi-level linear programs
• A quasiconcave minimization method for solving linear two-level programs
• Descent approaches for quadratic bilevel programming
• Bilevel and multilevel programming: A bibliography review
• The steepest descent direction for the nonlinear bilevel programming problem
• A multilevel analysis of agricultural credit distribution in East Java, Indonesia
• Links between linear bilevel and mixed 0-1 programming problems
• Pure competition, regulated and Stackelberg equilibria: Application to the energy system of Québec
• A bilevel programming approach to determining tax credits for biofuel production
• A partial cooperation model for non-unique linear two-level decision problems
• Bundle trust-region algorithm for bilinear bilevel programming
• Multilevel decision-making: a survey
• A semivectorial bilevel programming approach to optimize electricity dynamic time-of-use retail pricing
• A differential evolution with two mutation strategies and a selection based on an improved constraint-handling technique for bilevel programming problems
• A note on linearized reformulations for a class of bilevel linear integer problems
• Wireless LAN transmitter location under the threat of jamming attacks
• A branch and bound algorithm for solving a class of D-C programming
• Determining optimal pollution control policies: An application of bilevel programming
• A hybrid tabu-ascent algorithm for the linear bilevel programming problem
• On generalized semi-infinite optimization and bilevel optimization
• Fuzzy multiple level programming
• Multilevel flow control in telecommunication networks
• Fuzzy approach for multi-level programming problems
• Bilevel programming applied to the flow shop scheduling problem
• Algorithms for linear programming with linear complementarity constraints
• Linear bilevel programming solution by genetic algorithm
• Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm
• Stackelberg solutions to multiobjective two-level linear programming problems
• An effective bilevel programming approach for the evasive flow capturing location 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
• Designing an optimal contract mechanism in a cellulosic biofuel enterprise
• Computation of the optimal tolls on the traffic network
• Model, solution concept, and \(K\)th-best algorithm for linear trilevel programming
• Resolution method for mixed integer bi-level linear problems based on decomposition technique
• Solving linear programs with complementarity constraints using branch-and-cut
• Upper and lower bounds for the optimal values of the interval bilevel linear programming problem
• Competitive location in cognitive radio networks
• An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
• Bilevel linear programming
• Fuzzy multilevel programming with a hybrid intelligent algorithm
• Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem
• Basic theoretical foundations and insights on bilevel models and their applications to power systems
• A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
• A bi-level programming model and solution algorithm for the location of logistics distribution centers
• New branch-and-Cut algorithm for bilevel linear programming
• An overview of bilevel optimization
• A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
• A smoothing approach for solving transportation problem with road toll pricing and capacity expansions
• A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
• A note on the Pareto optimality of solutions to the linear bilevel programming problem
• The eigenvalue complementarity problem
• Data envelopment analysis approaches for two-level production and distribution planning problems
• scientific article; zbMATH DE number 1594502 (Why is no real title available?)
• Approximate decomposition algorithm for solving the bilevel programming with the minimum risk
• Incentive strategies with threats in dynamic constrained-stackelberg problems. a bilevel programming approach
• A study on the use of heuristics to solve a bilevel programming problem
• A pivoting algorithm for linear programming with linear complementarity constraints
• Lagrangean relaxation-based algorithm for bi-level problems
• Solving discretely-constrained Nash-Cournot games with an application to power markets
• The branch and bound method for a quadratic problem of bilevel programming
• AN ALGORITHM FOR SOLVING RULE SETS-BASED BILEVEL DECISION PROBLEMS
• An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
• Bi-level programming DEA approach for efficiency evaluation: a case study of Indian electronics retail stores
• AN EXTENDED BRANCH AND BOUND ALGORITHM FOR BILEVEL MULTI-FOLLOWER DECISION MAKING IN A REFERENTIAL-UNCOOPERATIVE SITUATION
• Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
• A method for solving bilevel linear programming problems
• Genetic algorithm for solving quadratic bilevel programming problem
• A FUZZY MULTI-OBJECTIVE BILEVEL DECISION SUPPORT SYSTEM
• A Relative Robust Optimization Approach for Full Factorial Scenario Design of Data Uncertainty and Ambiguity
• A class of expected value bilevel programming problems with random coefficients based on rough approximation and its application to a production-inventory system
• Stackelberg solutions for fuzzy random bilevel linear programming through level sets and probability maximization
• A simple algorithm for the-linear bilevel programming problem
• A bilevel programming problem with maximization of a supermodular function in the lower level
• scientific article; zbMATH DE number 35514 (Why is no real title available?)
• New Branch-and-Bound Rules for Linear Bilevel Programming
• Nodal interdiction
• Interactive fuzzy random two-level linear programming through fractile criterion optimization
• Stackelberg solutions for fuzzy random two-level linear programming through probability maximization with possibility
• scientific article; zbMATH DE number 1163112 (Why is no real title available?)
• Stackelberg solutions for fuzzy random two-level linear programming through level sets and fractile criterion optimization
• Oops! I cannot do it again: testing for recursive feasibility in MPC
• Complexity of fuzzy answer set programming under Łukasiewicz semantics
• Methodological Advances and New Formulations for Bilevel Network Design Problems
• 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
• scientific article; zbMATH DE number 817607 (Why is no real title available?)
• AN ITERATIVE ALGORITHM FOR A CLASS OF NONLINEAR INTEGER BILEVEL PROGRAMMING PROBLEMS WITH BOX CONSTRAINTS
• Semidefinite relaxation for linear programs with equilibrium constraints
• Inverse optimization with noisy data
• 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

This page was built for publication: A Branch and Bound Algorithm for the Bilevel Programming Problem

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