期刊
APPLIED MATHEMATICS AND COMPUTATION
卷 188, 期 1, 页码 808-813出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2006.10.045
关键词
linear bilevel programming; linear programming; Kuhn-Tucker condition; penalty method
Using the Kuhn-Tucker optimality condition of the lower level preblem, we transform the linear bilevel programming problem into a corresponding single level programming. The complementary and slackness condition of the lower level problem is appended to the upper level objective with a penalty. Then we decompose the linear bilevel programming into a series of linear programming problems and get the optimal solution of the linear bilevel programming using linear programming method. (C)) 2006 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据