IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v79y2021i1d10.1007_s10898-020-00931-x.html
   My bibliography  Save this article

A scalarization scheme for binary relations with applications to set-valued and robust optimization

Author

Listed:
  • C. Gutiérrez

    (University of Valladolid)

  • L. Huerga

    (UNED)

  • E. Köbis

    (Norwegian University of Science and Technology (NTNU))

  • C. Tammer

    (Martin-Luther University Halle-Wittenberg)

Abstract

In this paper, a method for scalarizing optimization problems whose final space is endowed with a binary relation is stated without assuming any additional hypothesis on the data of the problem. By this approach, nondominated and minimal solutions are characterized in terms of solutions of scalar optimization problems whose objective functions are the post-composition of the original objective with scalar functions satisfying suitable properties. The obtained results generalize some recent ones stated in quasi ordered sets and real topological linear spaces. Besides, they are applied both to characterize by scalarization approximate solutions of set optimization problems with set ordering and to generalize some recent conditions on robust solutions of optimization problems. For this aim, a new robustness concept in optimization under uncertainty is introduced which is interesting in itself.

Suggested Citation

  • C. Gutiérrez & L. Huerga & E. Köbis & C. Tammer, 2021. "A scalarization scheme for binary relations with applications to set-valued and robust optimization," Journal of Global Optimization, Springer, vol. 79(1), pages 233-256, January.
    • Handle: RePEc:spr:jglopt:v:79:y:2021:i:1:d:10.1007_s10898-020-00931-x
    DOI: 10.1007/s10898-020-00931-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-020-00931-x
    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/s10898-020-00931-x?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. Khushboo & C. S. Lalitha, 2018. "Scalarizations for a unified vector optimization problem based on order representing and order preserving properties," Journal of Global Optimization, Springer, vol. 70(4), pages 903-916, April.
    2. Gutiérrez, C. & Jiménez, B. & Novo, V., 2012. "Improvement sets and vector optimization," European Journal of Operational Research, Elsevier, vol. 223(2), pages 304-311.
    3. Serpil Say{i}n & Panos Kouvelis, 2005. "The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm," Management Science, INFORMS, vol. 51(10), pages 1572-1581, October.
    4. M. Chicco & F. Mignanego & L. Pusillo & S. Tijs, 2011. "Vector Optimization Problems via Improvement Sets," Journal of Optimization Theory and Applications, Springer, vol. 150(3), pages 516-529, September.
    5. Zhiang Zhou & Wang Chen & Xinmin Yang, 2019. "Scalarizations and Optimality of Constrained Set-Valued Optimization Using Improvement Sets and Image Space Analysis," Journal of Optimization Theory and Applications, Springer, vol. 183(3), pages 944-962, December.
    6. S. Deng, 2010. "Boundedness and Nonemptiness of the Efficient Solution Sets in Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 144(1), pages 29-42, January.
    7. A. L. Soyster, 1973. "Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming," Operations Research, INFORMS, vol. 21(5), pages 1154-1157, October.
    8. Panos Kouvelis & Serpil Sayın, 2006. "Algorithm robust for the bicriteria discrete optimization problem," Annals of Operations Research, Springer, vol. 147(1), pages 71-85, October.
    9. Jonas Ide & Elisabeth Köbis, 2014. "Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 80(1), pages 99-127, August.
    10. E. Miglierina & E. Molho, 2002. "Scalarization and Stability in Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 114(3), pages 657-670, September.
    11. Charalambos D. Aliprantis & Kim C. Border, 2006. "Infinite Dimensional Analysis," Springer Books, Springer, edition 0, number 978-3-540-29587-7, December.
    12. Klamroth, Kathrin & Köbis, Elisabeth & Schöbel, Anita & Tammer, Christiane, 2017. "A unified approach to uncertain optimization," European Journal of Operational Research, Elsevier, vol. 260(2), pages 403-420.
    Full references (including those not matched with items on IDEAS)

    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. Klamroth, Kathrin & Köbis, Elisabeth & Schöbel, Anita & Tammer, Christiane, 2017. "A unified approach to uncertain optimization," European Journal of Operational Research, Elsevier, vol. 260(2), pages 403-420.
    2. Botte, Marco & Schöbel, Anita, 2019. "Dominance for multi-objective robust optimization concepts," European Journal of Operational Research, Elsevier, vol. 273(2), pages 430-440.
    3. Alexander Engau, 2017. "Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 119-134, January.
    4. Jonas Ide & Anita Schöbel, 2016. "Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 235-271, January.
    5. Hong-Zhi Wei & Chun-Rong Chen & Sheng-Jie Li, 2020. "A Unified Approach Through Image Space Analysis to Robustness in Uncertain Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 466-493, February.
    6. César Gutiérrez & Rubén López & Vicente Novo, 2014. "Existence and Boundedness of Solutions in Infinite-Dimensional Vector Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 162(2), pages 515-547, August.
    7. Fakhar, Majid & Mahyarinia, Mohammad Reza & Zafarani, Jafar, 2018. "On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization," European Journal of Operational Research, Elsevier, vol. 265(1), pages 39-48.
    8. Morteza Rahimi & Majid Soleimani-damaneh, 2018. "Robustness in Deterministic Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 137-162, October.
    9. C. Gutiérrez & L. Huerga & B. Jiménez & V. Novo, 2018. "Approximate solutions of vector optimization problems via improvement sets in real linear spaces," Journal of Global Optimization, Springer, vol. 70(4), pages 875-901, April.
    10. Pirro Oppezzi & Anna Rossi, 2015. "Improvement Sets and Convergence of Optimal Points," Journal of Optimization Theory and Applications, Springer, vol. 165(2), pages 405-419, May.
    11. Maurizio Chicco & Anna Rossi, 2015. "Existence of Optimal Points Via Improvement Sets," Journal of Optimization Theory and Applications, Springer, vol. 167(2), pages 487-501, November.
    12. Shiva Kapoor & C. S. Lalitha, 2019. "Stability and Scalarization for a Unified Vector Optimization Problem," Journal of Optimization Theory and Applications, Springer, vol. 182(3), pages 1050-1067, September.
    13. Engau, Alexander & Sigler, Devon, 2020. "Pareto solutions in multicriteria optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 281(2), pages 357-368.
    14. Hong-Zhi Wei & Chun-Rong Chen & Sheng-Jie Li, 2018. "A Unified Characterization of Multiobjective Robustness via Separation," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 86-102, October.
    15. Bérubé, Jean-François & Gendreau, Michel & Potvin, Jean-Yves, 2009. "An exact [epsilon]-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits," European Journal of Operational Research, Elsevier, vol. 194(1), pages 39-50, April.
    16. Rekha R. Jaichander & Izhar Ahmad & Krishna Kummari & Suliman Al-Homidan, 2022. "Robust Nonsmooth Interval-Valued Optimization Problems Involving Uncertainty Constraints," Mathematics, MDPI, vol. 10(11), pages 1-19, May.
    17. Elisabeth Köbis, 2015. "On Robust Optimization," Journal of Optimization Theory and Applications, Springer, vol. 167(3), pages 969-984, December.
    18. Stacey Faulkenberg & Margaret Wiecek, 2012. "Generating equidistant representations in biobjective programming," Computational Optimization and Applications, Springer, vol. 51(3), pages 1173-1210, April.
    19. Shiva Kapoor & C. S. Lalitha, 2019. "Stability in unified semi-infinite vector optimization," Journal of Global Optimization, Springer, vol. 74(2), pages 383-399, June.
    20. Qamrul Hasan Ansari & Elisabeth Köbis & Pradeep Kumar Sharma, 2019. "Characterizations of Multiobjective Robustness via Oriented Distance Function and Image Space Analysis," Journal of Optimization Theory and Applications, Springer, vol. 181(3), pages 817-839, June.

    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:jglopt:v:79:y:2021:i:1:d:10.1007_s10898-020-00931-x. 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.