An algorithm for linear bilevel programming problems

Shi, C; Zhang, G; Lu, J

An algorithm for linear bilevel programming problems

Shi, C Zhang, G

Lu, J

Permalink

Publication Type:: Conference Proceeding
Citation:: Applied Computational Intelligence - Proceedings of the 6th International FLINS Conference, 2004, pp. 300 - 303
Issue Date:: 2004-12-01

Closed Access

	Filename	Description	Size
	2004001849.pdf		442.73 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	2004-12-01	en_US
dc.identifier.citation	Applied Computational Intelligence - Proceedings of the 6th International FLINS Conference, 2004, pp. 300 - 303	en_US
dc.identifier.isbn	9812388737	en_US
dc.identifier.uri	http://hdl.handle.net/10453/1837
dc.description.abstract	For linear bilevel programming problems, the branch and bound algorithm is the most successful algorithm to deal with the complementary constraints arising from Kuhn-Tucker conditions. This paper proposes a new branch and bound algorithm for linear bilevel programming problems. Based on this result, a web-based bilevel decision support system is developed.	en_US
dc.relation.ispartof	Applied Computational Intelligence - Proceedings of the 6th International FLINS Conference	en_US
dc.title	An algorithm for linear bilevel programming problems	en_US
dc.type	Conference Proceeding
utslib.for	080108 Neural, Evolutionary and Fuzzy Computation	en_US
utslib.for	080105 Expert Systems	en_US
dc.location.activity	Blankenberghe, Belgium	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.publication-status	Published	en_US

Abstract:

For linear bilevel programming problems, the branch and bound algorithm is the most successful algorithm to deal with the complementary constraints arising from Kuhn-Tucker conditions. This paper proposes a new branch and bound algorithm for linear bilevel programming problems. Based on this result, a web-based bilevel decision support system is developed.

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

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