Journal
APPLIED MATHEMATICS AND COMPUTATION
Volume 180, Issue 2, Pages 529-537Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2005.12.039
Keywords
linear bilevel programming; branch and bound algorithm; optimization; Von Stackelberg game
Categories
Ask authors/readers for more resources
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. (c) 2006 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available