Journal
APPLIED MATHEMATICS AND COMPUTATION
Volume 188, Issue 1, Pages 808-813Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2006.10.045
Keywords
linear bilevel programming; linear programming; Kuhn-Tucker condition; penalty method
Categories
Ask authors/readers for more resources
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.
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