An extended branch and bound algorithm for linear bilevel programming

Shi, C; Lu, J; Zhang, G; Zhou, H

An extended branch and bound algorithm for linear bilevel programming

Shi, C Lu, J

Zhang, G

Zhou, H

Permalink

Publication Type:: Journal Article
Citation:: Applied Mathematics and Computation, 2006, 180 (2), pp. 529 - 537
Issue Date:: 2006-09-15

Closed Access

	Filename	Description	Size
	2006005646.pdf		561.61 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.contributor.author	Zhou, H	en_US
dc.date.issued	2006-09-15	en_US
dc.identifier.citation	Applied Mathematics and Computation, 2006, 180 (2), pp. 529 - 537	en_US
dc.identifier.issn	0096-3003	en_US
dc.identifier.uri	http://hdl.handle.net/10453/3438
dc.description.abstract	For linear bilevel programming, the branch and bound algorithm is the most successful algorithm to deal with the complementary constraints arising from Kuhn-Tucker conditions. However, one principle challenge is that it could not well handle a linear bilevel programming problem when the constraint functions at the upper-level are of arbitrary linear form. This paper proposes an extended branch and bound algorithm to solve this problem. The results have demonstrated that the extended branch and bound algorithm can solve a wider class of linear bilevel problems can than current capabilities permit. © 2006 Elsevier Inc. All rights reserved.	en_US
dc.relation.ispartof	Applied Mathematics and Computation	en_US
dc.relation.isbasedon	10.1016/j.amc.2005.12.039	en_US
dc.subject.classification	Numerical & Computational Mathematics	en_US
dc.title	An extended branch and bound algorithm for linear bilevel programming	en_US
dc.type	Journal Article
utslib.citation.volume	2	en_US
utslib.citation.volume	180	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	2	en_US
pubs.publication-status	Published	en_US
pubs.volume	180	en_US

Abstract:

For linear bilevel programming, the branch and bound algorithm is the most successful algorithm to deal with the complementary constraints arising from Kuhn-Tucker conditions. However, one principle challenge is that it could not well handle a linear bilevel programming problem when the constraint functions at the upper-level are of arbitrary linear form. This paper proposes an extended branch and bound algorithm to solve this problem. The results have demonstrated that the extended branch and bound algorithm can solve a wider class of linear bilevel problems can than current capabilities permit. © 2006 Elsevier Inc. All rights reserved.

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

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