IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v296y2022i1p101-115.html
   My bibliography  Save this article

Multiobjective optimization under uncertainty: A multiobjective robust (relative) regret approach

Author

Listed:
  • Groetzner, Patrick
  • Werner, Ralf

Abstract

Consider a multiobjective decision problem with uncertainty in the objective functions, given as a set of scenarios. In the single-criterion case, robust optimization methodology helps to identify solutions which remain feasible and of good quality for all possible scenarios. A well-known alternative method in the single-objective case is to compare possible decisions under uncertainty with the optimal decision with the benefit of hindsight, i.e. to minimize the (possibly scaled) regret of not having chosen the optimal decision. In this contribution, we extend the concept of regret from the single-objective case to the multiobjective setting and introduce a proper definition of multivariate (robust) (relative) regret. In contrast to the few existing ideas that mix scalarization and optimization, we clearly separate the modelling of multiobjective (robust) regret from its numerical solution. Moreover, our approach is not limited to a finite uncertainty set or interval uncertainty and furthermore, computations or at least approximations remain tractable in several important special cases. We illustrate all approaches based on a biobjective shortest path problem under uncertainty.

Suggested Citation

  • Groetzner, Patrick & Werner, Ralf, 2022. "Multiobjective optimization under uncertainty: A multiobjective robust (relative) regret approach," European Journal of Operational Research, Elsevier, vol. 296(1), pages 101-115.
  • Handle: RePEc:eee:ejores:v:296:y:2022:i:1:p:101-115
    DOI: 10.1016/j.ejor.2021.03.068
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721003738
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2021.03.068?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. Sanjay Mehrotra & David Papp, 2013. "A cutting surface algorithm for semi-infinite convex programming with an application to moment robust optimization," Papers 1306.3437, arXiv.org, revised Aug 2014.
    2. T Drezner & Z Drezner & S Salhi, 2006. "A multi-objective heuristic approach for the casualty collection points location problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 727-734, June.
    3. Fliege, Jörg & Werner, Ralf, 2014. "Robust multiobjective optimization & applications in portfolio optimization," European Journal of Operational Research, Elsevier, vol. 234(2), pages 422-433.
    4. 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.
    5. Gonçalo Simões & Mark McDonald & Stacy Williams & Daniel Fenn & Raphael Hauser, 2018. "Relative Robust Portfolio Optimization with benchmark regret," Quantitative Finance, Taylor & Francis Journals, vol. 18(12), pages 1991-2003, December.
    6. S. Rivaz & M. A. Yaghoobi & M. Hladík, 2016. "Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem," Fuzzy Optimization and Decision Making, Springer, vol. 15(3), pages 237-253, September.
    7. Raphael Hauser & Vijay Krishnamurthy & Reha Tutuncu, 2013. "Relative Robust Portfolio Optimization," Papers 1305.0144, arXiv.org, revised May 2013.
    8. Li-Ping Pang & Jian Lv & Jin-He Wang, 2016. "Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems," Computational Optimization and Applications, Springer, vol. 64(2), pages 433-465, June.
    9. Goberna, M.A. & Jeyakumar, V. & Li, G. & Vicente-Pérez, J., 2015. "Robust solutions to multi-objective linear programs with uncertain data," European Journal of Operational Research, Elsevier, vol. 242(3), pages 730-743.
    10. 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.
    11. Xidonas, Panos & Mavrotas, George & Hassapis, Christis & Zopounidis, Constantin, 2017. "Robust multiobjective portfolio optimization: A minimax regret approach," European Journal of Operational Research, Elsevier, vol. 262(1), pages 299-305.
    12. Thai Doan Chuong & Do Sang Kim, 2014. "Nonsmooth Semi-infinite Multiobjective Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 160(3), pages 748-762, March.
    13. Harvey J. Greenberg & William P. Pierskalla, 1971. "A Review of Quasi-Convex Functions," Operations Research, INFORMS, vol. 19(7), pages 1553-1570, December.
    14. 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.
    15. A. Auslender & A. Ferrer & M. Goberna & M. López, 2015. "Comparative study of RPSALG algorithm for convex semi-infinite programming," Computational Optimization and Applications, Springer, vol. 60(1), pages 59-87, January.
    16. 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.
    17. S. Rivaz & M. Yaghoobi, 2013. "Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(3), pages 625-649, September.
    18. 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.
    19. Akiko Takeda & Shunsuke Taguchi & Tsutomu Tanaka, 2010. "A relaxation algorithm with a probabilistic guarantee for robust deviation optimization," Computational Optimization and Applications, Springer, vol. 47(1), pages 1-31, September.
    20. Jörg Fliege, 2006. "An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems," Mathematics of Operations Research, INFORMS, vol. 31(4), pages 825-845, November.
    21. 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.
    22. Inuiguchi, Masahiro & Sakawa, Masatoshi, 1995. "Minimax regret solution to linear programming problems with an interval objective function," European Journal of Operational Research, Elsevier, vol. 86(3), pages 526-536, November.
    23. Raith, Andrea & Schmidt, Marie & Schöbel, Anita & Thom, Lisa, 2018. "Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty," European Journal of Operational Research, Elsevier, vol. 267(2), pages 628-642.
    24. 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.
    25. Stein, Oliver, 2012. "How to solve a semi-infinite optimization problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 312-320.
    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. Han, Bing & Zhang, Ying & Wang, Song & Park, Yongshin, 2023. "The efficient and stable planning for interrupted supply chain with dual‐sourcing strategy: a robust optimization approach considering decision maker's risk attitude," Omega, Elsevier, vol. 115(C).
    2. Qi, Yue & Liao, Kezhi & Liu, Tongyang & Zhang, Yu, 2022. "Originating multiple-objective portfolio selection by counter-COVID measures and analytically instigating robust optimization by mean-parameterized nondominated paths," Operations Research Perspectives, Elsevier, vol. 9(C).

    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. Schöbel, Anita & Zhou-Kangas, Yue, 2021. "The price of multiobjective robustness: Analyzing solution sets to uncertain multiobjective problems," European Journal of Operational Research, Elsevier, vol. 291(2), pages 782-793.
    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. Schmidt, M. & Schöbel, Anita & Thom, Lisa, 2019. "Min-ordering and max-ordering scalarization methods for multi-objective robust optimization," European Journal of Operational Research, Elsevier, vol. 275(2), pages 446-459.
    4. Yao, Zhaosheng & Wang, Zhiyuan & Ran, Lun, 2023. "Smart charging and discharging of electric vehicles based on multi-objective robust optimization in smart cities," Applied Energy, Elsevier, vol. 343(C).
    5. Engau, Alexander & Sigler, Devon, 2020. "Pareto solutions in multicriteria optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 281(2), pages 357-368.
    6. 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.
    7. Jiang, Ling & Cao, Jinde & Xiong, Lianglin, 2019. "Generalized multiobjective robustness and relations to set-valued optimization," Applied Mathematics and Computation, Elsevier, vol. 361(C), pages 599-608.
    8. Morteza Rahimi & Majid Soleimani-damaneh, 2020. "Characterization of Norm-Based Robust Solutions in Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 185(2), pages 554-573, May.
    9. Qi, Yue & Liao, Kezhi & Liu, Tongyang & Zhang, Yu, 2022. "Originating multiple-objective portfolio selection by counter-COVID measures and analytically instigating robust optimization by mean-parameterized nondominated paths," Operations Research Perspectives, Elsevier, vol. 9(C).
    10. 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.
    11. 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.
    12. Jiawei Chen & Elisabeth Köbis & Jen-Chih Yao, 2019. "Optimality Conditions and Duality for Robust Nonsmooth Multiobjective Optimization Problems with Constraints," Journal of Optimization Theory and Applications, Springer, vol. 181(2), pages 411-436, May.
    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. Pinar, Mehmet & Stengos, Thanasis & Topaloglou, Nikolas, 2020. "On the construction of a feasible range of multidimensional poverty under benchmark weight uncertainty," European Journal of Operational Research, Elsevier, vol. 281(2), pages 415-427.
    15. Goberna, M.A. & Jeyakumar, V. & Li, G. & Vicente-Pérez, J., 2018. "Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs," European Journal of Operational Research, Elsevier, vol. 270(1), pages 40-50.
    16. 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.
    17. Goberna, M.A. & Jeyakumar, V. & Li, G. & Vicente-Pérez, J., 2022. "The radius of robust feasibility of uncertain mathematical programs: A Survey and recent developments," European Journal of Operational Research, Elsevier, vol. 296(3), pages 749-763.
    18. 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.
    19. 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.
    20. Caprari, Elisa & Cerboni Baiardi, Lorenzo & Molho, Elena, 2019. "Primal worst and dual best in robust vector optimization," European Journal of Operational Research, Elsevier, vol. 275(3), pages 830-838.

    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:eee:ejores:v:296:y:2022:i:1:p:101-115. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.