Article ID: | iaor2007415 |
Country: | Netherlands |
Volume: | 160 |
Issue: | 1 |
Start Page Number: | 169 |
End Page Number: | 176 |
Publication Date: | Jan 2005 |
Journal: | Applied Mathematics and Computation |
Authors: | Shi Chenggen, Zhang Guangquan, Lu Jie |
Keywords: | game theory |
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.