The price of multiobjective robustness: Analyzing solution sets to uncertain multiobjective problems

被引:11
作者
Schoebel, Anita [1 ,2 ]
Zhou-Kangas, Yue [3 ]
机构
[1] Tech Univ Kaiserslautern, Fac Math, Kaiserslautern, Germany
[2] Tech Univ Kaiserslautern, Fraunhofer Inst Ind Math ITWM, Kaiserslautern, Germany
[3] Univ Jyvaskyla, Fac Informat Technol, POB 35, FI-40014 Jyvaskyla, Finland
关键词
Multiobjective robust optimization; Decision making; Uncertainty; Price of robustness; INNER APPROXIMATION METHOD; EFFICIENT SET; LIGHT ROBUSTNESS; OPTIMIZATION; ALGORITHM; REGRET;
D O I
10.1016/j.ejor.2020.09.045
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Defining and finding robust efficient solutions to uncertain multiobjective optimization problems has been an issue of growing interest recently. Different concepts have been published defining what a "robust efficient" solution is. Each of these concepts leads to a different set of solutions, but it is difficult to visualize and understand the differences between these sets. In this paper we develop an approach for comparing such sets of robust efficient solutions, namely we analyze their outcomes under the nominal scenario and in the worst case using the upper set-less order from set-valued optimization. Analyzing the set of nominal efficient solutions, the set of minmax robust efficient solutions and different sets of lightly robust efficient solutions gives insight into robustness and nominal objective function values of these sets of solutions. Among others we can formally prove that lightly robust efficient solutions are good compromises between nominal efficient solutions and minmax robust efficient solutions. In addition, we also propose a measure to quantify the price of robustness of a single solution. Based on the measure, we propose two strategies which can be used to support a decision maker to find solutions to a multiobjective optimization problem under uncertainty. All our results are illustrated by examples. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页码:782 / 793
页数:12
相关论文
共 56 条
[1]  
[Anonymous], 1993, Decisions with Multiple Objectives
[2]   On Approximate Efficiency for Nonsmooth Robust Vector Optimization Problems [J].
Antczak, Tadeusz ;
Pandey, Yogendra ;
Singh, Vinay ;
Mishra, Shashi Kant .
ACTA MATHEMATICA SCIENTIA, 2020, 40 (03) :887-902
[3]   Adjustable robust solutions of uncertain linear programs [J].
Ben-Tal, A ;
Goryashko, A ;
Guslitzer, E ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2004, 99 (02) :351-376
[4]   An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem [J].
Benson, Harold P. .
JOURNAL OF GLOBAL OPTIMIZATION, 2012, 52 (03) :553-574
[5]   OPTIMIZATION OVER THE EFFICIENT SET [J].
BENSON, HP .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1984, 98 (02) :562-580
[6]   New closedness results for efficient sets in multiple objective mathematical programming [J].
Benson, HP ;
Sun, EJ .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1999, 238 (01) :277-296
[7]  
BenTal A, 2009, PRINC SER APPL MATH, P1
[8]   The price of robustness [J].
Bertsimas, D ;
Sim, M .
OPERATIONS RESEARCH, 2004, 52 (01) :35-53
[9]  
Binh T.T., 1997, 3 INT C GEN ALG MEND, V25, P27
[10]   LINEAR MULTIPLE OBJECTIVE PROBLEMS WITH INTERVAL-COEFFICIENTS [J].
BITRAN, GR .
MANAGEMENT SCIENCE, 1980, 26 (07) :694-706