Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 73, 2024 - Issue 6
181
Views
0
CrossRef citations to date
0
Altmetric
Research Article

The point-based robustness gap for uncertain multiobjective optimization

, , &
Pages 1897-1931 | Received 06 Jan 2022, Accepted 24 Jan 2023, Published online: 28 Feb 2023

References

  • Ben-Tal A, Ghaoui LE, Nemirovski A. Robust optimization. Princeton and Oxford: Princeton University Press; 2009.
  • Ide J, Schöbel A. Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts. OR Spectr. 2016;38(1):235–271.
  • Wiecek MM, Dranichak GM. Robust multiobjective optimization for decision making under uncertainty and conflict. chap. 4, INFORMS; 2016. p. 84–114.
  • Botte M, Schöbel A. Dominance for multi-objective robust optimization concepts. Eur J Oper Res. 2018;273:430–440.
  • Chuong TD. Optimality and duality for robust multiobjective optimization problems. Nonlinear Anal Theory Methods Appl. 2016;134:127–143.
  • Fliege J, Werner R. Robust multiobjective optimization & applications in portfolio optimization. Eur J Oper Res. 2014;234(2):422–433.
  • Goberna MA, Jeyakumar V, Li G, et al. Robust solutions of multiobjective linear semi-infinite programs under constraint data uncertainty. SIAM J Optim. 2014;24(3):1402–1419.
  • Groetzner P, Werner R. Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach. Eur J Oper Res. 2022;296(1):101–115.
  • Kuroiwa D, Lee GM. On robust multiobjective optimization. Vietnam J Math. 2012;40(2&3):305–317.
  • Schöbel A, Zhou-Kangas Y. The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems. EJOR. 2021;291(2):782–793.
  • Ehrgott M, Ide J, Schöbel A. Minmax robustness for multi-objective optimization problems. Eur J Oper Res. 2014;239(1):17–31.
  • Eichfelder G, Krüger C, Schöbel A. Decision uncertainty in multiobjective optimization. J Glob Optim. 2017;69(2):485–510.
  • Ben-Tal A, Nemirovski A. Robust convex optimization. Math Oper Res. 1998;23(4):769–805.
  • Ben-Tal A, Nemirovski A. Robust solutions of uncertain linear programs. Oper Res Lett. 1999;25(1):1–13.
  • Ehrgott M. Multicriteria optimization. Germany: Springer Berlin Heidelberg; 2005.
  • Dranichak G, Wiecek M. On computing highly robust efficient solutions. J Multi-Criteria Decis Anal. 2018;25(5-6):177–188.
  • Dranichak G, Wiecek M. On highly robust solutions to uncertain multiobjective linear programs. Eur J Oper Res. 2019;273(1):20–30.
  • Goberna MA, Jeyakumar V, Li G, et al. Robust solutions to multi-objective linear programs with uncertain data. Eur J Oper Res. 2015;242(3):730–743.
  • Pando GG, Luc DT, Pardalos P. Robust aspects of solutions in deterministic multiple objective linear programming. Eur J Oper Res. 2013;229(1):29–36.
  • Kuhn K, Raith A, Schmidt M, et al. Bi-objective robust optimisation. Eur J Oper Res. 2016;252(2):418–431.
  • Doolittle E, Kerivin H, Wiecek MM. A robust multiobjective optimization problem with application to internet routing. Ann Oper Res. 2018;271:487–525.
  • Luc DT. On the domination property in vector optimization. J Optim Theory Appl. 1984;43(2):327–330.
  • Ballestero E, Romero C. Multiple criteria decision making and its applications to economic problems. Boston, MA: Kluwer; 1998.
  • Hartley R. On cone-efficiency, cone-convexity and cone-compactness. SIAM J Appl Math. 1978;34(2):211–222.
  • Benson H, Sun E. New closedness results for efficient sets in multiple objective mathematical programming. J Math Anal Appl. 1999;238(1):277–296.
  • Geoffrion AM. Proper efficiency and the theory of vector maximization. J Math Anal Appl. 1968;22(3):618–630.
  • Bot R, Grad S, Wanka G. Duality in vector optimization. Springer; 2009. (Vector Optimization).
  • Luc DT. Theory of vector optimization. Berlin: Springer-Verlag; 1989. (Lecture Notes in Economics and Mathematical Systems; Vol. 319).
  • Berge C. Topological spaces: including a treatment of multi-valued functions, vector spaces and convexity. London: Oliver & Boyd; 1963.
  • Ben-Tal A, Nemirovski A. Robust optimization – methodology and applications. Math Program. 2002;92(3):453–480.
  • Bertsimas D, Nohadani O, Teo KM. Robust optimization in electromagnetic scattering problems. J Appl Phys. 2007;101(7):074507.
  • Das I. Robustness opimization for constrained nonlinear programming problems. Eng Optim. 2000;32(5):585–618.
  • Lewis A, Pang C. Lipschitz behaviour of the robust regularization. SIAM J Control Optim. 2009;48(5):3080–3105.
  • Stinstra E. Robust optimization using computer experiments. Eur J Oper Res. 2008;191(3):816–837.
  • Kim NTB, Luc DT. Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming. Acta Math Vietnam. 2000;25(1):101–124.
  • Ward JE, Wendell RE. Using block norms for location modeling. Oper Res. 1985;33(5):1074–1090.
  • Carrizosa E, Goerigk M, Schöbel A. A biobjective approach to recovery robustness based on location planning. Eur J Oper Res. 2017;261(2):421–435.
  • Horst R, Thoai NV. DC programming: overview. J Optim Theory Appl. 1999;103(1):1–43.
  • Tuy H. D.C. Optimization: theory, methods and algorithms. In: Handbook of Global Optimization, Nonconvex Optimization and Its Applications, Vol. 2, Springer; 1995. p. 149–216.
  • Le Thi HA, Pham Dinh T. DC programming and DCA: thirty years of developments. Math Program. 2018;169(1):5–68.
  • Ide J, Köbis E, Kuroiwa D, et al. The relationship between multi-objective robustness concepts and set valued optimization. Fixed Point Theory Appl. 2014;2014(1).

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.