An extended Kth-best approach for linear bilevel programming

Elsevier Science Inc
Publication Type:
Journal Article
Applied Mathematics And Computation, 2005, 164 (3), pp. 843 - 855
Issue Date:
Full metadata record
Files in This Item:
Filename Description SizeFormat
2005000774.pdf447.56 kBAdobe PDF
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.
Please use this identifier to cite or link to this item: