IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v185y2020i2d10.1007_s10957-020-01657-2.html
   My bibliography  Save this article

Convergence of Solutions to Set Optimization Problems with the Set Less Order Relation

Author

Listed:
  • Lam Quoc Anh

    (Cantho University)

  • Tran Quoc Duy

    (Ton Duc Thang University
    Ton Duc Thang University)

  • Dinh Vinh Hien

    (University of Science, Vietnam National University Ho Chi Minh City
    Ho Chi Minh City University of Food Industry)

  • Daishi Kuroiwa

    (Shimane University)

  • Narin Petrot

    (Naresuan University)

Abstract

This article investigates stability conditions for set optimization problems with the set less order relation in the senses of Panilevé–Kuratowski and Hausdorff convergence. Properties of various kinds of convergences for elements in the image space are discussed. Taking such properties into account, formulations of internal and external stability of the solutions are studied in the image space in terms of the convergence of a solution sets sequence of perturbed set optimization problems to a solution set of the given problem.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:joptap:v:185:y:2020:i:2:d:10.1007_s10957-020-01657-2
    DOI: 10.1007/s10957-020-01657-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-020-01657-2
    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-020-01657-2?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. César Gutiérrez & Enrico Miglierina & Elena Molho & Vicente Novo, 2016. "Convergence of Solutions of a Set Optimization Problem in the Image Space," Journal of Optimization Theory and Applications, Springer, vol. 170(2), pages 358-371, August.
    2. Yu Han & Nan-jing Huang, 2018. "Continuity and Convexity of a Nonlinear Scalarizing Function in Set Optimization Problems with Applications," Journal of Optimization Theory and Applications, Springer, vol. 177(3), pages 679-695, June.
    3. Johannes Jahn, 2017. "Karush–Kuhn–Tucker Conditions in Set Optimization," Journal of Optimization Theory and Applications, Springer, vol. 172(3), pages 707-725, March.
    4. Giovanni P. Crespi & Mansi Dhingra & C. S. Lalitha, 2018. "Pointwise and global well-posedness in set optimization: a direct approach," Annals of Operations Research, Springer, vol. 269(1), pages 149-166, October.
    5. Y. D. Xu & S. J. Li, 2016. "On the solution continuity of parametric set optimization problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 84(1), pages 223-237, August.
    6. Michel H. Geoffroy, 2019. "A topological convergence on power sets well-suited for set optimization," Journal of Global Optimization, Springer, vol. 73(3), pages 567-581, March.
    7. S. Khoshkhabar-amiranloo & E. Khorram, 2015. "Pointwise well-posedness and scalarization in set optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(2), pages 195-210, October.
    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. L. Q. Anh & T. Q. Duy & D. V. Hien, 2020. "Stability of efficient solutions to set optimization problems," Journal of Global Optimization, Springer, vol. 78(3), pages 563-580, November.
    2. Chuang-Liang Zhang & Nan-jing Huang, 2021. "Set Relations and Weak Minimal Solutions for Nonconvex Set Optimization Problems with Applications," Journal of Optimization Theory and Applications, Springer, vol. 190(3), pages 894-914, September.

    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. Yu Han & Kai Zhang & Nan-jing Huang, 2020. "The stability and extended well-posedness of the solution sets for set optimization problems via the Painlevé–Kuratowski convergence," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 91(1), pages 175-196, February.
    2. L. Q. Anh & T. Q. Duy & D. V. Hien, 2020. "Stability of efficient solutions to set optimization problems," Journal of Global Optimization, Springer, vol. 78(3), pages 563-580, November.
    3. Kuntal Som & V. Vetrivel, 2023. "Global well-posedness of set-valued optimization with application to uncertain problems," Journal of Global Optimization, Springer, vol. 85(2), pages 511-539, February.
    4. Khushboo & C. S. Lalitha, 2019. "A unified minimal solution in set optimization," Journal of Global Optimization, Springer, vol. 74(1), pages 195-211, May.
    5. Kuntal Som & Vellaichamy Vetrivel, 2022. "A Note on Pointwise Well-Posedness of Set-Valued Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 192(2), pages 628-647, February.
    6. Meenakshi Gupta & Manjari Srivastava, 2020. "Approximate Solutions and Levitin–Polyak Well-Posedness for Set Optimization Using Weak Efficiency," Journal of Optimization Theory and Applications, Springer, vol. 186(1), pages 191-208, July.
    7. Dumitru Motreanu & Van Thien Nguyen & Shengda Zeng, 2020. "Existence of Solutions for Implicit Obstacle Problems of Fractional Laplacian Type Involving Set-Valued Operators," Journal of Optimization Theory and Applications, Springer, vol. 187(2), pages 391-407, November.
    8. Chuang-Liang Zhang & Nan-jing Huang, 2021. "Set Relations and Weak Minimal Solutions for Nonconvex Set Optimization Problems with Applications," Journal of Optimization Theory and Applications, Springer, vol. 190(3), pages 894-914, September.
    9. 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.
    10. Pham Huu Sach & Le Anh Tuan, 2021. "Semicontinuity Property of Approximate Solution Mappings in Bifunction-Set Optimization," Journal of Optimization Theory and Applications, Springer, vol. 191(1), pages 202-228, October.
    11. Pham Huu Sach, 2018. "Stability Property in Bifunction-Set Optimization," Journal of Optimization Theory and Applications, Springer, vol. 177(2), pages 376-398, May.
    12. 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.
    13. S. Khoshkhabar-amiranloo, 2021. "Scalarization of Multiobjective Robust Optimization Problems," SN Operations Research Forum, Springer, vol. 2(3), pages 1-16, September.
    14. L. Q. Anh & T. Q. Duy & D. V. Hien, 2020. "Well-posedness for the optimistic counterpart of uncertain vector optimization problems," Annals of Operations Research, Springer, vol. 295(2), pages 517-533, December.
    15. L. Huerga & B. Jiménez & V. Novo & A. Vílchez, 2021. "Six set scalarizations based on the oriented distance: continuity, convexity and application to convex set optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(2), pages 413-436, April.
    16. 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.
    17. Y. D. Xu & S. J. Li, 2016. "On the solution continuity of parametric set optimization problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 84(1), pages 223-237, August.

    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:185:y:2020:i:2:d:10.1007_s10957-020-01657-2. 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.