Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9507288 | Applied Mathematics and Computation | 2005 | 8 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Chenggen Shi, Guangquan Zhang, Jie Lu,