IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v172y2017i3d10.1007_s10957-017-1066-7.html
   My bibliography  Save this article

Karush–Kuhn–Tucker Conditions in Set Optimization

Author

Listed:
  • Johannes Jahn

    (Universität Erlangen-Nürnberg)

Abstract

This paper investigates set optimization problems in finite dimensional spaces with the property that the images of the set-valued objective map are described by inequalities and equalities and that sets are compared with the set less order relation. For these problems new Karush–Kuhn–Tucker conditions are shown as necessary and sufficient optimality conditions. Optimality conditions without multiplier of the objective map are also presented. The usefulness of these results is demonstrated with a standard example.

Suggested Citation

  • Johannes Jahn, 2017. "Karush–Kuhn–Tucker Conditions in Set Optimization," Journal of Optimization Theory and Applications, Springer, vol. 172(3), pages 707-725, March.
    • Handle: RePEc:spr:joptap:v:172:y:2017:i:3:d:10.1007_s10957-017-1066-7
    DOI: 10.1007/s10957-017-1066-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-017-1066-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-017-1066-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Johannes Jahn, 2015. "Vectorization in Set Optimization," Journal of Optimization Theory and Applications, Springer, vol. 167(3), pages 783-795, December.
    2. H. Th. Jongen & T. Möbert & K. Tammer, 1986. "On Iterated Minimization in Nonconvex Optimization," Mathematics of Operations Research, INFORMS, vol. 11(4), pages 679-691, November.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Horng, Shih-Cheng & Lin, Shieh-Shing, 2019. "Bat algorithm assisted by ordinal optimization for solving discrete probabilistic bicriteria optimization problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 166(C), pages 346-364.
    2. Lam Quoc Anh & Tran Quoc Duy & Dinh Vinh Hien & Daishi Kuroiwa & Narin Petrot, 2020. "Convergence of Solutions to Set Optimization Problems with the Set Less Order Relation," Journal of Optimization Theory and Applications, Springer, vol. 185(2), pages 416-432, May.
    3. Saeid Akhavan Bitaghsir & Ahmad Khonsari, 2019. "Modeling and improving the throughput of vehicular networks using cache enabled RSUs," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 70(3), pages 391-404, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gabriele Eichfelder & Maria Pilecka, 2016. "Set Approach for Set Optimization with Variable Ordering Structures Part II: Scalarization Approaches," Journal of Optimization Theory and Applications, Springer, vol. 171(3), pages 947-963, December.
    2. Gabriele Eichfelder & Maria Pilecka, 2016. "Set Approach for Set Optimization with Variable Ordering Structures Part I: Set Relations and Relationship to Vector Approach," Journal of Optimization Theory and Applications, Springer, vol. 171(3), pages 931-946, December.
    3. Johannes Jahn, 2022. "Characterizations of the Set Less Order Relation in Nonconvex Set Optimization," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 523-544, June.
    4. Khushboo & C. S. Lalitha, 2023. "Characterizations of set order relations and nonlinear scalarizations via generalized oriented distance function in set optimization," Journal of Global Optimization, Springer, vol. 85(1), pages 235-249, January.
    5. Elisabeth Köbis & Markus A. Köbis & Xiaolong Qin, 2020. "An Inequality Approach to Approximate Solutions of Set Optimization Problems in Real Linear Spaces," Mathematics, MDPI, vol. 8(1), pages 1-17, January.

    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:joptap:v:172:y:2017:i:3:d:10.1007_s10957-017-1066-7. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.