An Algorithm for Linear Bilevel Programming Problems

World Scientific
Publication Type:
Conference Proceeding
Applied Computational Intelligence Proceedings of the 6th International FLINS Conference, 2004, pp. 300 - 303
Issue Date:
Full metadata record
Files in This Item:
Filename Description SizeFormat
2004001849.pdf442.73 kBAdobe PDF
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: