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

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

0.00 Avg rating0 Votes
Article ID: iaor20061404
Country: Germany
Volume: 33
Issue: 4
Start Page Number: 563
End Page Number: 578
Publication Date: Dec 2005
Journal: Journal of Global Optimization
Authors: , ,
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.