Generalized bilevel programming problems

Simple item page
dc.contributor.authorYe, J. J.
dc.contributor.authorZhu, D. L.
dc.contributor.authorZhu, Q.
dc.date.accessioned2010-05-25T22:05:32Z
dc.date.available2010-05-25T22:05:32Z
dc.date.copyright1993en
dc.date.issued2010-05-25T22:05:32Z
dc.description.abstractThe generalized bilevel programming problem (GBLP) is a mathematical programming problem with variational inequality constraints. In this paper by error bound approach, we establish some equivalent single level formulation of the generalized bilevel programming problem. The necessary optimality condition of Kuhn-Tucker type are then given by using nonsmooth analysis.en
dc.description.sponsorshipNSERC Grant WFA 0123160en
dc.identifier.urihttp://hdl.handle.net/1828/2800
dc.language.isoenen
dc.relation.ispartofseriesDMS-646-IRen
dc.subjectgeneralized bilevel programming problemsen
dc.subjectvariational inequalityen
dc.subjecterror bounden
dc.subjectnecessary optimality conditionen
dc.subjectnonsmooth analysisen
dc.titleGeneralized bilevel programming problemsen
dc.typeTechnical Reporten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
DMS 646.pdf
Size:
1.13 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.84 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Technical Reports (Mathematics and Statistics)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.