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

UTSePress Research/Manakin Repository

Search UTSePress Research

Advanced Search


My Account

Show simple item record Shi, Chenggen en_US Zhang, Guangquan en_US Lu, Jie en_US 2009-12-21T02:28:09Z 2009-12-21T02:28:09Z 2005 en_US
dc.identifier 2005000646 en_US
dc.identifier.citation Shi Chenggen, Zhang Guangquan, and Lu Jie 2005, 'The Kth-best approach for linear bilevel multi-follower programming', Springer, vol. 33, no. 4, pp. 563-578. en_US
dc.identifier.issn 0925-5001 en_US
dc.identifier.other C1 en_US
dc.description.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 en_US
dc.publisher Springer en_US
dc.relation.isbasedon en_US
dc.title The Kth-best approach for linear bilevel multi-follower programming en_US
dc.parent Journal Of Global Optimization en_US
dc.journal.volume 33 en_US
dc.journal.number 4 en_US
dc.publocation Dordrecht, Netherlands en_US
dc.identifier.startpage 563 en_US
dc.identifier.endpage 578 en_US FEIT.School of Systems, Management and Leadership en_US
dc.conference Verified OK en_US
dc.for 080200 en_US
dc.personcode 02014710 en_US
dc.personcode 020014 en_US
dc.personcode 001038 en_US
dc.percentage 33 en_US Computation Theory and Mathematics en_US
dc.classification.type FOR-08 en_US
dc.custom 0.693 en_US
dc.description.keywords bilevel decision-making; decision-making optimization; Kth-best approach; linear bilevel programming; multi-follower programming en_US
dc.staffid 001038 en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record