IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-0-387-34221-4_3.html
   My bibliography  Save this book chapter

Bilevel programming with convex lower level problems

In: Optimization with Multivalued Mappings

Author

Listed:
  • Joydeep Dutta

    (Indian Institute of Technology)

  • Stephan Dempe

    (Technical University Bergakademie Freiberg)

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.

Suggested Citation

  • Joydeep Dutta & Stephan Dempe, 2006. "Bilevel programming with convex lower level problems," Springer Optimization and Its Applications, in: Stephan Dempe & Vyacheslav Kalashnikov (ed.), Optimization with Multivalued Mappings, pages 51-71, Springer.
    • Handle: RePEc:spr:spochp:978-0-387-34221-4_3
    DOI: 10.1007/0-387-34221-4_3
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Guillaume Allaire Pouliot & Zhen Xie, 2022. "Degrees of Freedom and Information Criteria for the Synthetic Control Method," Papers 2207.02943, arXiv.org.
    2. Boris S. Mordukhovich & Nguyen Mau Nam & Hung M. Phan, 2012. "Variational Analysis of Marginal Functions with Applications to Bilevel Programming," Journal of Optimization Theory and Applications, Springer, vol. 152(3), pages 557-586, March.
    3. Stephan Dempe & Alain B. Zemkoho, 2011. "The Generalized Mangasarian-Fromowitz Constraint Qualification and Optimality Conditions for Bilevel Programs," Journal of Optimization Theory and Applications, Springer, vol. 148(1), pages 46-68, January.
    4. Stephan Dempe & Maria Pilecka, 2015. "Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming," Journal of Global Optimization, Springer, vol. 61(4), pages 769-788, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-0-387-34221-4_3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.