期刊
APPLIED MATHEMATICS AND COMPUTATION
卷 180, 期 2, 页码 529-537出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2005.12.039
关键词
linear bilevel programming; branch and bound algorithm; optimization; Von Stackelberg game
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据