New Branch-and-Bound Rules for Linear Bilevel Programming
- 1 September 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 13 (5), 1194-1217
- https://doi.org/10.1137/0913069
Abstract
No abstract availableThis publication has 29 references indexed in Scilit:
- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programmingAnnals of Operations Research, 1992
- A Branch and Bound Algorithm for the Bilevel Programming ProblemSIAM Journal on Scientific and Statistical Computing, 1990
- Convex two-level optimizationMathematical Programming, 1988
- A solution method for the static constrained Stackelberg problem via penalty methodIEEE Transactions on Automatic Control, 1984
- Two-Level Linear ProgrammingManagement Science, 1984
- An Efficient Point Algorithm for a Linear Two-Stage Optimization ProblemOperations Research, 1983
- An Algorithm for Solving the General Bilevel Programming ProblemMathematics of Operations Research, 1983
- On two-level optimizationIEEE Transactions on Automatic Control, 1982
- An explicit solution to the multi-level programming problemComputers & Operations Research, 1982
- Hierarchical Decentralized Systems and Its New Solution by a Barrier MethodIEEE Transactions on Systems, Man, and Cybernetics, 1981