AN ALGORITHM FOR LINEAR BILEVEL PROGRAMMING PROBLEMS
Chenggen Shi, Guangquan Zhang, Jie Lü · 2004
For linear bilevel programming problems, the branch and bound algorithm is the most successful algorithm to deal with the complementary constraints arising from Kuhn-Tucker conditions. This paper proposes a new branch and bound algorithm for linear bilevel programming problems. Based on this result, a web-based bilevel decision support system is developed.