An extended branch and bound algorithm for linear bilevel programming
Authors:
- Chenggen ShiCSChenggen Shi
- Jie LuJLJie Lu
- Guangquan ZhangGZGuangquan Zhang
- Hong ZhouHZHong Zhou
- 1 September 2006
- journal article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 180 (2) , 529-537
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An extended Kth-best approach for linear bilevel programmingApplied Mathematics and Computation, 2005
- An extended Kuhn–Tucker approach for linear bilevel programmingApplied Mathematics and Computation, 2005
- On the definition of linear bilevel programming solutionApplied Mathematics and Computation, 2005
- A penalty function approach for solving bi-level linear programsJournal of Global Optimization, 1993
- New Branch-and-Bound Rules for Linear Bilevel ProgrammingSIAM Journal on Scientific and Statistical Computing, 1992
- A Branch and Bound Algorithm for the Bilevel Programming ProblemSIAM Journal on Scientific and Statistical Computing, 1990
- Two-Level Linear ProgrammingManagement Science, 1984
- An explicit solution to the multi-level programming problemComputers & Operations Research, 1982
- A linear two-level programming problemComputers & Operations Research, 1982
- A Representation and Economic Interpretation of a Two-Level Programming ProblemJournal of the Operational Research Society, 1981