An extended Kth-best approach for linear bilevel programming

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 oil our previous work, this paper proposes theoretical propel-ties of linear bilevel programming and presents an extended Kth-best approach for linear bilevel programming which can effectively solve above problem. (c) 2004 Elsevier Inc. All rights reserved.