An extended Kuhn-Tucker approach for linear bilevel programming

Shi, C; Lu, J; Zhang, G

An extended Kuhn-Tucker approach for linear bilevel programming

Shi, C Lu, J

Zhang, G

Permalink

Publication Type:: Journal Article
Citation:: Applied Mathematics and Computation, 2005, 162 (1), pp. 51 - 63
Issue Date:: 2005-03-04

Closed Access

	Filename	Description	Size
	2005000775.pdf		364 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-03-04	en_US
dc.identifier.citation	Applied Mathematics and Computation, 2005, 162 (1), pp. 51 - 63	en_US
dc.identifier.issn	0096-3003	en_US
dc.identifier.uri	http://hdl.handle.net/10453/3423
dc.description.abstract	Kuhn-Tucker approach has been applied with remarkable success in linear bilevel programming (BLP). However, it still has some extent unsatisfactory and incomplete. One principle challenges is that it could not well handle a linear BLP problem when the constraint functions at the upper-level are of arbitrary linear form. This paper describes theoretical foundation of Kuhn-Tucker approach and proposes an extended Kuhn-Tucker approach to deal with the problem. The results have demonstrated that the extended Kuhn-Tucker approach can solve a wider class of linear BLP problems can than current capabilities permit. © 2004 Elsevier Inc. All rights reserved.	en_US
dc.relation.ispartof	Applied Mathematics and Computation	en_US
dc.relation.isbasedon	10.1016/j.amc.2003.12.089	en_US
dc.subject.classification	Numerical & Computational Mathematics	en_US
dc.title	An extended Kuhn-Tucker approach for linear bilevel programming	en_US
dc.type	Journal Article
utslib.citation.volume	1	en_US
utslib.citation.volume	162	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
dc.location.activity	Munich, Germany
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	162	en_US

Abstract:

Kuhn-Tucker approach has been applied with remarkable success in linear bilevel programming (BLP). However, it still has some extent unsatisfactory and incomplete. One principle challenges is that it could not well handle a linear BLP problem when the constraint functions at the upper-level are of arbitrary linear form. This paper describes theoretical foundation of Kuhn-Tucker approach and proposes an extended Kuhn-Tucker approach to deal with the problem. The results have demonstrated that the extended Kuhn-Tucker approach can solve a wider class of linear BLP problems can than current capabilities permit. © 2004 Elsevier Inc. All rights reserved.

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

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