IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v80y2014i1p99-127.html
   My bibliography  Save this article

Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations

Author

Listed:
  • Jonas Ide
  • Elisabeth Köbis

Abstract

In this paper we present new concepts of efficiency for uncertain multi-objective optimization problems. We analyze the connection between the concept of minmax robust efficiency presented by Ehrgott et al. (Eur J Oper Res, 2014 , doi: 10.1016/j.ejor.2014.03.013 ) and the upper set less order relation $$\preceq _s^u$$ ⪯ s u introduced by Kuroiwa ( 1998 , 1999 ). From this connection we derive new concepts of efficiency for uncertain multi-objective optimization problems by replacing the set ordering with other set orderings. Those are namely the lower set less ordering (see Kuroiwa 1998 , 1999 ), the set less ordering (see Nishnianidze in Soobshch Akad Nauk Gruzin SSR 114(3):489–491, 1984 ; Young in Math Ann 104(1):260–290, 1931 , doi: 10.1007/BF01457934 ; Eichfelder and Jahn in Vector Optimization. Springer, Berlin, 2012 ), the certainly less ordering (see Eichfelder and Jahn in Vector Optimization. Springer, Berlin, 2012 ), and the alternative set less ordering (see Ide et al. in Fixed Point Theory Appl, 2014 , doi: 10.1186/1687-1812-2014-83 ; Köbis 2014 ). We analyze the resulting concepts of efficiency and present numerical results on the occurrence of the various concepts. We conclude the paper with a short comparison between the concepts, and an outlook to further work. Copyright Springer-Verlag Berlin Heidelberg 2014

Suggested Citation

  • 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.
  • Handle: RePEc:spr:mathme:v:80:y:2014:i:1:p:99-127
    DOI: 10.1007/s00186-014-0471-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-014-0471-z
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s00186-014-0471-z?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. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    2. F. Guerriero & R. Musmanno, 2001. "Label Correcting Methods to Solve Multicriteria Shortest Path Problems," Journal of Optimization Theory and Applications, Springer, vol. 111(3), pages 589-613, December.
    3. Katrin Witting & Sina Ober-Blöbaum & Michael Dellnitz, 2013. "A variational approach to define robustness for parametric multiobjective optimization problems," Journal of Global Optimization, Springer, vol. 57(2), pages 331-345, October.
    4. Ehrgott, Matthias & Ide, Jonas & Schöbel, Anita, 2014. "Minmax robustness for multi-objective optimization problems," European Journal of Operational Research, Elsevier, vol. 239(1), pages 17-31.
    5. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    6. H. Yu & H. M. Liu, 2013. "Robust Multiple Objective Game Theory," Journal of Optimization Theory and Applications, Springer, vol. 159(1), pages 272-280, October.
    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. Kuhn, K. & Raith, A. & Schmidt, M. & Schöbel, A., 2016. "Bi-objective robust optimisation," European Journal of Operational Research, Elsevier, vol. 252(2), pages 418-431.
    2. 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.
    3. Erin K. Doolittle & Hervé L. M. Kerivin & Margaret M. Wiecek, 2018. "Robust multiobjective optimization with application to Internet routing," Annals of Operations Research, Springer, vol. 271(2), pages 487-525, December.
    4. Mavrotas, George & Figueira, José Rui & Siskos, Eleftherios, 2015. "Robustness analysis methodology for multi-objective combinatorial optimization problems and application to project selection," Omega, Elsevier, vol. 52(C), pages 142-155.
    5. Bokrantz, Rasmus & Fredriksson, Albin, 2017. "Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization," European Journal of Operational Research, Elsevier, vol. 262(2), pages 682-692.
    6. Panos Xidonas & Ralph Steuer & Christis Hassapis, 2020. "Robust portfolio optimization: a categorized bibliographic review," Annals of Operations Research, Springer, vol. 292(1), pages 533-552, September.
    7. Zheng, Liang & Bao, Ji & Xu, Chengcheng & Tan, Zhen, 2022. "Biobjective robust simulation-based optimization for unconstrained problems," European Journal of Operational Research, Elsevier, vol. 299(1), pages 249-262.
    8. Yue Zhou-Kangas & Kaisa Miettinen, 2019. "Decision making in multiobjective optimization problems under uncertainty: balancing between robustness and quality," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 391-413, June.
    9. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    10. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    11. Stefan Mišković, 2017. "A VNS-LP algorithm for the robust dynamic maximal covering location problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1011-1033, October.
    12. Chassein, André & Dokka, Trivikram & Goerigk, Marc, 2019. "Algorithms and uncertainty sets for data-driven robust shortest path problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 671-686.
    13. Dranichak, Garrett M. & Wiecek, Margaret M., 2019. "On highly robust efficient solutions to uncertain multiobjective linear programs," European Journal of Operational Research, Elsevier, vol. 273(1), pages 20-30.
    14. M. J. Naderi & M. S. Pishvaee, 2017. "Robust bi-objective macroscopic municipal water supply network redesign and rehabilitation," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 31(9), pages 2689-2711, July.
    15. Evers, L. & Dollevoet, T.A.B. & Barros, A.I. & Monsuur, H., 2011. "Robust UAV Mission Planning," Econometric Institute Research Papers EI 2011-07, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    16. Mínguez, R. & García-Bertrand, R., 2016. "Robust transmission network expansion planning in energy systems: Improving computational performance," European Journal of Operational Research, Elsevier, vol. 248(1), pages 21-32.
    17. Xuejie Bai & Yankui Liu, 2016. "Robust optimization of supply chain network design in fuzzy decision system," Journal of Intelligent Manufacturing, Springer, vol. 27(6), pages 1131-1149, December.
    18. Chassein, André & Goerigk, Marc, 2018. "Compromise solutions for robust combinatorial optimization with variable-sized uncertainty," European Journal of Operational Research, Elsevier, vol. 269(2), pages 544-555.
    19. Kang, Yan-li & Tian, Jing-Song & Chen, Chen & Zhao, Gui-Yu & Li, Yuan-fu & Wei, Yu, 2021. "Entropy based robust portfolio," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 583(C).
    20. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.

    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:mathme:v:80:y:2014:i:1:p:99-127. 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.