Optimality conditions for bilevel programming problems

dc.contributor.authorYe, J. J.
dc.contributor.authorZhu, D. L.
dc.date.accessioned2010-04-26T20:03:37Z
dc.date.available2010-04-26T20:03:37Z
dc.date.copyright1993en
dc.date.issued2010-04-26T20:03:37Z
dc.descriptionOriginally published September 1992. Revised July 1993.en
dc.description.abstractThe bilevel programming problem (BLPP) is a sequence of two optimization problems where the constraint region of the upper level problem is determined implicitly by the solution set to the lower level problem. To obtain optimality conditions, we reformulate BLPP as a single level mathematical programming problem (SLPP) which involves the value function of the lower level problem. For this mathematical programming problem, it is shown that the usual constraint qualifications do not hold and the right constraint qualification is the calmness condition. It is also shown that for certain problems such as the linear bilevel programming problem and the minmax problem, the calmness condition is satisfied. First order necessary optimality conditions are given by using the nonsmooth analysis technique. Second-order sufficient optimality conditions are also given for the case where the lower level problem is unconstrained.en
dc.identifier.urihttp://hdl.handle.net/1828/2650
dc.language.isoenen
dc.relation.ispartofseriesDMS-618-IRen
dc.subjectOptimality conditionsen
dc.subjectBilevel programming problemen
dc.subjectNonsmooth analysisen
dc.subjectConstraint qualificationen
dc.titleOptimality conditions for bilevel programming problemsen
dc.typeTechnical Reporten

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
DMS-618-IR.pdf
Size:
830.7 KB
Format:
Adobe Portable Document Format
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: