| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4635240 | Applied Mathematics and Computation | 2007 | 6 Pages |
Abstract
Using the Kuhn–Tucker optimality condition of the lower level problem, 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Yibing Lv, Tiesong Hu, Guangmin Wang, Zhongping Wan,