×

Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces. (English) Zbl 1502.90166

The most powerful results are already established for robust optimization in the finite dimension case, both for under risk and uncertain multi-objective optimization. The result in this paper is to state and analyze problems that deal with infinite-dimensional frameworks. The robust optimization is known as the problem that the uncertain objective and constraint are satisfied for all possible scenarios within a prescribed uncertainty set. The notation is basically standard in variational analysis. The main purpose in this paper is to investigate a non-smooth/nonconvex multi-objective optimization problem with uncertain constraints in arbitrary Asplund spaces under the pseudo convexity assumptions. The authors first establish a necessary optimality theorem for weakly robust efficient solutions of the problem (UP) by employing a fuzzy optimality condition of a non-smooth/nonconvex multi-objective optimization problem without any constrained qualification in the sense of the Fréchet subdifferential, and then derive a necessary optimality condition for properly robust efficient solutions of the problem. Problem (UP) is defined by the authors as followed: Suppose that \(f:Z\to Y\) is a locally Lipschitzian vector-valued function between Asplund spaces, and that \(K\subset Y\) is a pointed closed convex cone. (P) is the following multiobjective optimization problem: \(min_Kf(z)\) s.t. \(g_i(z)\leq 0\), \(i=1,2,\dots,n\), where the functions \(g_i:Z\to \mathbb{R}\), \(i=1,2,\dots,n\), define the constraints. Problem (P) in the face of data uncertainty in the constraints can be captured by the following uncertain multiobjective optimization problem: (UP) \(min_K f(z)\) s.t. \(g_i(z,u)\leq 0\), \(i=1,2,\dots,n\), where \(z\in Z\) is the vector of decision variables, \(u\) is the vector of uncertain parameters and \(u\in U\) for some sequentially compact topological space \(U\), and \(g_i:Z\times U\to \mathbb{R}\), \(i=1,2,\dots,n\), are given functions.
Sufficient conditions for weakly and properly efficient solutions as well as for robust efficient solutions to such a problem are also provided by means of applying the new concepts of generalized pseudo convex functions. Along with optimality conditions, the authors address a Mond-Weir-type robust dual problem to the problem (UP) and explore weak, strong, and converse duality properties under assumptions of pseudo convexity. Motivated by the concept of pseudo-quasi generalized convexity due to M. Fakhar et al. [Eur. J. Oper. Res. 265, No. 1, 39–48 (2018; Zbl 1374.90335)], they introduce a similar concept of pseudo-quasi convexity type for objective functions. The outline of the paper is organized as follows:
Introduction
some preliminary definitions (type I pseudo convex and type II pseudo convex for \((f,g)\)) and several auxiliary results are recalled into Section 2;
Section 3 is devoted to study necessary optimality conditions for weakly and properly robust efficient solutions of problem (UP) by exploiting the non-smooth version of Fermat’s rule, the sum rule for the limiting subdifferential and the scalarization formulae of the coderivatives, and to discuss sufficient optimality conditions for such solutions as well as for robust efficient solutions by imposing the pseudo convexity assumptions.
Section 4 is devoted to presenting duality (weak, strong, converse) relations between the corresponding problems. The paper also contains examples for the usage of the new results.

MSC:

90C29 Multi-objective and goal programming
90C46 Optimality conditions and duality in mathematical programming
90C48 Programming in abstract spaces
90C17 Robustness in mathematical programming
65K10 Numerical optimization and variational techniques

Citations:

Zbl 1374.90335
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] A. Ben-Tal, L.E. Ghaoui, and A. Nemirovski. Robust Optimization. Princeton Series in Applied Mathematics. Princeton University Press, 2009. · Zbl 1221.90001
[2] A. Ben-Tal and A. Nemirovski. “Robust optimization-methodology and applications”. In: Math. Program 92 (2002), pp. 453 -480. · Zbl 1007.90047
[3] A. Ben-Tal and A. Nemirovski. “Selected topics in robust convex optimiza-tion”. In: Math. Program 112 (2008), pp. 125 -158. · Zbl 1135.90046
[4] D. Bertsimas, D. Brown, and C. Caramanis. “Theory and applications of robust optimization”. In: SIAM Rev. 53.3 (2011), pp. 464 -501. · Zbl 1233.90259
[5] R. Bokrantz and A. Fredriksson. “Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization”. In: Eur. J. Oper. Res. 262.2 (2017), pp. 682 -692. · Zbl 1375.90270
[6] J. Chen, E. Köbis, and J.C. Yao. “Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints”. In: J. Optim. Theory Appl. 181 (2019), pp. 411 -436. · Zbl 1451.90139
[7] T.D. Chuong. “Optimality and duality for robust multiobjective optimiza-tion problems”. In: Nonlinear Anal. 134 (2016), pp. 127 -143. · Zbl 1334.49069
[8] T.D. Chuong. “Optimality and duality in nonsmooth conic vector optimiza-tion”. In: J. Optim. Theory Appl. 183 (2019), pp. 471 -489. · Zbl 1425.49008
[9] T.D. Chuong. “Robust optimality and duality in multiobjective optimiza-tion problems under data uncertainty”. In: SIAM J. Optim. 30.2 (2020), 1501 -1526. · Zbl 1483.90149
[10] K. Deb and H. Gupta. “Introducing robustness in multiobjective optimiza-tion”. In: Evol. Comput. 14 (2006), pp. 463 -494.
[11] K. Deb and H. Gupta. “Searching for robust Pareto-optimal solutions in multiobjective optimization, Evolutionary multi-criterion optimization”. In: Lecture Notes in Computer Science 3410 (2005), pp. 150 -164. · Zbl 1109.68591
[12] M. Ehrgott, J. Ide, and A. Schöbel. “Minmax robustness for multi-objective optimization problems”. In: Eur. J. Oper. Res. 239.1 (2014), pp. 17 -31. · Zbl 1339.90296
[13] M. Fakhar, M.R. Mahyarinia, and J. Zafarani. “On nonsmooth robust mul-tiobjective optimization under generalized convexity with applications to portfolio optimization”. In: Eur. J. Oper. Res. 265 (2018), pp. 39 -48. · Zbl 1374.90335
[14] J. Ide. Concepts of robustness for uncertain multiobjective optimization. Ph.D. thesis. University of Göttingen, 2014. · Zbl 1337.90003
[15] J. Ide and E. Köbis. “Concepts of efficiency for uncertain multiobjective problems based on set order relations”. In: Math. Meth. Oper. Res. 80 (2014), pp. 99 -127. · Zbl 1302.90198
[16] J. Ide et al. “The relationship between multiobjective robustness concepts and set valued optimization”. In: Fixed Point Theory Appl. 2014.83 (2014), pp. 1 -20. · Zbl 1333.90118
[17] J. Jahn. Vector Optimization: Theory, Applications, and Extensions. Springer-Verlag Berlin Heidelberg, 2004. · Zbl 1055.90065
[18] V. Jeyakumar and G. Li. “Strong duality in robust convex programming: complete characterizations”. In: SIAM J. Optim. 20 (2010), pp. 3384 -3407. · Zbl 1228.90075
[19] V. Jeyakumar, G. Li, and G.M. Lee. “Robust duality for generalized convex programming problems under data uncertainty”. In: Nonlinear Anal. 75.3 (2012), pp. 1362 -1373. · Zbl 1254.90154
[20] D. Kuroiwa and G.M. Lee. “On robust multiobjective optimization”. In: Vietnam J. Math. 40 (2012), pp. 305 -317. · Zbl 1302.90199
[21] G.M. Lee and P.T. Son. “On nonsmooth optimality theorems for robust op-timization problems”. In: Bull. Korean Math. Soc. 51 (2014), pp. 287 -301. · Zbl 1291.90253
[22] J.H. Lee and G.M. Lee. “On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems”. In: Ann. Oper. Res. 269 (2018), pp. 419 -438. · Zbl 1446.90143
[23] B.S. Mordukhovich. Variational Analysis and Generalized Differentiation I: Ba-sic Theory. Grundlehren der mathematischen Wissenschaften. Springer-Verlag Berlin Heidelberg, 2006.
[24] B.S. Mordukhovich, N.M. Nam, and N.D. Yen. “Fréchet subdifferential cal-culus and optimality conditions in nondifferentiable programming”. In: Optimization 55 (2006), pp. 685 -708. · Zbl 1121.49017
[25] B.S. Mordukhovich and T.T.A. Nghia. “Nonsmooth cone-constrained opti-mization with applications to semi-infinite programming”. In: Math. Oper. Res. 39.2 (2014), pp. 301 -324. · Zbl 1291.49014
[26] B.S. Mordukhovich and T.T.A. Nghia. “Subdifferentials of nonconvex supre-mum functions and their applications to semi-infinite and infinite programs with lipschitzian data”. In: SIAM J. Optim. 23.1 (2013), pp. 406 -431. · Zbl 1266.49027
[27] M.M. Wiecek and G.M. Dranichak. ”Robust multiobjective optimization for · Zbl 1403.90603
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.