An extended branch and bound algorithm for linear bilevel programming
- Publication Type:
- Journal Article
- Applied Mathematics and Computation, 2006, 180 (2), pp. 529 - 537
- Issue Date:
For linear bilevel programming, the branch and bound algorithm is the most successful algorithm to deal with the complementary constraints arising from Kuhn-Tucker conditions. However, one principle challenge is that it could not well handle a linear bilevel programming problem when the constraint functions at the upper-level are of arbitrary linear form. This paper proposes an extended branch and bound algorithm to solve this problem. The results have demonstrated that the extended branch and bound algorithm can solve a wider class of linear bilevel problems can than current capabilities permit. © 2006 Elsevier Inc. All rights reserved.
Please use this identifier to cite or link to this item: