On the definition of linear bilevel programming solution

Shi, C; Zhang, G; Lu, J

On the definition of linear bilevel programming solution

Shi, C Zhang, G

Lu, J

Permalink

Publication Type:: Journal Article
Citation:: Applied Mathematics and Computation, 2005, 160 (1), pp. 169 - 176
Issue Date:: 2005-01-05

Closed Access

	Filename	Description	Size
	2005003335.pdf		301.3 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-01-05	en_US
dc.identifier.citation	Applied Mathematics and Computation, 2005, 160 (1), pp. 169 - 176	en_US
dc.identifier.issn	0096-3003	en_US
dc.identifier.uri	http://hdl.handle.net/10453/3450
dc.description.abstract	Linear bilevel programming theory has been studied for many years by a number of researchers from different aspects, yet it still remains to some extent unsatisfactory and incomplete. The main challenge is how to solve a linear bilevel programming problem when the upper-level's constraint functions are of arbitrary linear form. This paper proposes a definition for linear bilevel programming solution. The performance comparisons have demonstrated that the new model can solve a wider class of problems than current capabilities permit. © 2003 Elsevier Inc. All rights reserved.	en_US
dc.relation.ispartof	Applied Mathematics and Computation	en_US
dc.relation.isbasedon	10.1016/j.amc.2003.10.031	en_US
dc.subject.classification	Numerical & Computational Mathematics	en_US
dc.title	On the definition of linear bilevel programming solution	en_US
dc.type	Journal Article
utslib.citation.volume	1	en_US
utslib.citation.volume	160	en_US
utslib.for	010206 Operations Research	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	1	en_US
pubs.publication-status	Published	en_US
pubs.volume	160	en_US

Abstract:

Linear bilevel programming theory has been studied for many years by a number of researchers from different aspects, yet it still remains to some extent unsatisfactory and incomplete. The main challenge is how to solve a linear bilevel programming problem when the upper-level's constraint functions are of arbitrary linear form. This paper proposes a definition for linear bilevel programming solution. The performance comparisons have demonstrated that the new model can solve a wider class of problems than current capabilities permit. © 2003 Elsevier Inc. All rights reserved.

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

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