The Kth-best approach for linear bilevel multi-follower programming

Publication Type:
Journal Article
Journal of Global Optimization, 2005, 33 (4), pp. 563 - 578
Issue Date:
Filename Description Size
Thumbnail2005000646.pdf478.31 kB
Adobe PDF
Full metadata record
The majority of research on bilevel programming has centered on the linear version of the problem in which only one leader and one follower are involved. This paper addresses linear bilevel multi-follower programming (BLMFP) problems in which there is no sharing information among followers. It explores the theoretical properties of linear BLMFP, extends the Kth-best approach for solving linear BLMFP problems and gives a computational test for this approach. © Springer 2005.
Please use this identifier to cite or link to this item: