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

Shi, C; Zhang, G; Lu, J

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

Shi, C Zhang, G

Lu, J

Permalink

Publication Type:: Journal Article
Citation:: Journal of Global Optimization, 2005, 33 (4), pp. 563 - 578
Issue Date:: 2005-12-01

Closed Access

	Filename	Description	Size
	2005000646.pdf		478.31 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Shi, C	en_US
dc.contributor.author	Zhang, G https://orcid.org/0000-0003-3960-0583	en_US
dc.contributor.author	Lu, J https://orcid.org/0000-0003-0690-4732	en_US
dc.date.issued	2005-12-01	en_US
dc.identifier.citation	Journal of Global Optimization, 2005, 33 (4), pp. 563 - 578	en_US
dc.identifier.issn	0925-5001	en_US
dc.identifier.uri	http://hdl.handle.net/10453/3468
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 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.	en_US
dc.relation.ispartof	Journal of Global Optimization	en_US
dc.relation.isbasedon	10.1007/s10898-004-7739-4	en_US
dc.subject.classification	Operations Research	en_US
dc.title	The Kth-best approach for linear bilevel multi-follower programming	en_US
dc.type	Journal Article
utslib.citation.volume	4	en_US
utslib.citation.volume	33	en_US
utslib.for	0803 Computer Software	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0103 Numerical and Computational Mathematics	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - CAI - Centre for Artificial Intelligence
utslib.copyright.status	closed_access
pubs.issue	4	en_US
pubs.publication-status	Published	en_US
pubs.volume	33	en_US

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. © Springer 2005.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/3468