An extended Kth-best approach for linear bilevel programming

Shi, C; Lu, J; Zhang, G

An extended Kth-best approach for linear bilevel programming

Shi, C Lu, J

Zhang, G

Permalink

Publication Type:: Journal Article
Citation:: Applied Mathematics and Computation, 2005, 164 (3), pp. 843 - 855
Issue Date:: 2005-05-25

Closed Access

	Filename	Description	Size
	2005000774.pdf		447.56 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	Lu, J https://orcid.org/0000-0003-0690-4732	en_US
dc.contributor.author	Zhang, G https://orcid.org/0000-0003-3960-0583	en_US
dc.date.issued	2005-05-25	en_US
dc.identifier.citation	Applied Mathematics and Computation, 2005, 164 (3), pp. 843 - 855	en_US
dc.identifier.issn	0096-3003	en_US
dc.identifier.uri	http://hdl.handle.net/10453/3461
dc.description.abstract	Kth-best approach is one of the three popular and workable approaches for linear bilevel programming. However, it could not well deal with a linear bilevel programming problem when the constraint functions at the upper-level are of arbitrary linear form. Based on our previous work, this paper proposes theoretical properties of linear bilevel programming and presents an extended Kth-best approach for linear bilevel programming which can effectively solve above problem. © 2004 Elsevier Inc. All rights reserved.	en_US
dc.relation.ispartof	Applied Mathematics and Computation	en_US
dc.relation.isbasedon	10.1016/j.amc.2004.06.047	en_US
dc.subject.classification	Numerical & Computational Mathematics	en_US
dc.title	An extended Kth-best approach for linear bilevel programming	en_US
dc.type	Journal Article
utslib.citation.volume	3	en_US
utslib.citation.volume	164	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0103 Numerical and Computational Mathematics	en_US
utslib.for	0802 Computation Theory and 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	3	en_US
pubs.publication-status	Published	en_US
pubs.volume	164	en_US

Abstract:

Kth-best approach is one of the three popular and workable approaches for linear bilevel programming. However, it could not well deal with a linear bilevel programming problem when the constraint functions at the upper-level are of arbitrary linear form. Based on our previous work, this paper proposes theoretical properties of linear bilevel programming and presents an extended Kth-best approach for linear bilevel programming which can effectively solve above problem. © 2004 Elsevier Inc. All rights reserved.

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

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