On the definition of linear bilevel programming solution

Publication Type:
Journal Article
Applied Mathematics and Computation, 2005, 160 (1), pp. 169 - 176
Issue Date:
Filename Description Size
Thumbnail2005003335.pdf301.3 kB
Adobe PDF
Full metadata record
Linear bilevel programming theory has been studied for many years by a number of researchers from different aspects, yet it still remains to some extent unsatisfactory and incomplete. The main challenge is how to solve a linear bilevel programming problem when the upper-level's constraint functions are of arbitrary linear form. This paper proposes a definition for linear bilevel programming solution. The performance comparisons have demonstrated that the new model can solve a wider class of problems than current capabilities permit. © 2003 Elsevier Inc. All rights reserved.
Please use this identifier to cite or link to this item: