An extended branch and bound algorithm for linear bilevel programming
Article
Article Title | An extended branch and bound algorithm for linear bilevel programming |
---|---|
ERA Journal ID | 49 |
Article Category | Article |
Authors | Shi, Chenggen (Author), Lu, Jie (Author), Zhang, Guangquan (Author) and Zhou, Hong (Author) |
Journal Title | Applied Mathematics and Computation |
Journal Citation | 180 (2), pp. 529-537 |
Number of Pages | 9 |
Year | 2006 |
Place of Publication | United States |
ISSN | 0096-3003 |
1873-5649 | |
Web Address (URL) | http://www.elsevier.com/wps/find/journaldescription.cws_home/522482/description#description |
Abstract | [Abstract]: 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. |
Keywords | linear bilevel programming, branch and bound algorithm, Optimization, Von Stackelberg game |
ANZSRC Field of Research 2020 | 490399. Numerical and computational mathematics not elsewhere classified |
461399. Theory of computation not elsewhere classified | |
Public Notes | File reproduced in accordance with the copyright policy of the publisher/author. |
Byline Affiliations | University of Technology Sydney |
Department of Electrical, Electronic and Computer Engineering |
https://research.usq.edu.au/item/9xz03/an-extended-branch-and-bound-algorithm-for-linear-bilevel-programming
Download files
2098
total views1446
total downloads1
views this month0
downloads this month