An algorithm for linear bilevel programming problems
- Publication Type:
- Conference Proceeding
- Applied Computational Intelligence - Proceedings of the 6th International FLINS Conference, 2004, pp. 300 - 303
- Issue Date:
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.
Please use this identifier to cite or link to this item: