| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9507162 | Applied Mathematics and Computation | 2005 | 13 Pages |
Abstract
Kth-best approach is one of the three popular and workable approaches for linear bilevel programming. However, it could not well deal with a linear bilevel programming problem when the constraint functions at the upper-level are of arbitrary linear form. Based on our previous work, this paper proposes theoretical properties of linear bilevel programming and presents an extended Kth-best approach for linear bilevel programming which can effectively solve above problem.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Chenggen Shi, Jie Lu, Guangquan Zhang,