Bilevel programming with convex lower level problems

Joydeep Dutta () and Stephan Dempe ()
Additional contact information
Joydeep Dutta: Indian Institute of Technology
Stephan Dempe: Technical University Bergakademie Freiberg

A chapter in Optimization with Multivalued Mappings, 2006, pp 51-71 from Springer

Abstract: Summary In this article we develop certain necessary optimality condition for bilevel programming problems with convex lower-level problem. The results are abstract in nature and depend on an important construction in nonsmooth analysis called the coderivative of a set-valued map.

Keywords: Optimistic bilevel programming problem; coderivative of set-valued map; necessary optimality conditions (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations: View citations in EconPapers (4)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-34221-4_3

Ordering information: This item can be ordered from
http://www.springer.com/9780387342214

DOI: 10.1007/0-387-34221-4_3

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().