Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization

Robust optimization is a fast growing methodology to study optimization problems with uncertain data. An uncertain vector optimization problem can be studied through its robust or optimistic counterpart, as in Ben-Tal and Nemirovski (Math Oper Res 23:769–805, 1998) and Beck and Ben-Tal (Oper Res Lett 37: 1–6, 2009). In this paper we formulate the counterparts as set optimization problems. This setting appears to be more natural, especially when the uncertain problem is a non-linear vector optimization problem. Under this setting we study the well-posedness of both the robust and the optimistic counterparts, using the embedding technique for set optimization developed in Kuroiwa and Nuriya (Proceedings of the fourth international conference on nonlinear and convex analysis, pp 297–304, 2006). To prove our main results we also need to study the notion of quasiconvexity for set-valued maps, that is the property of convexity of level set. We provide a general scheme to define the notion of level set and we study the relations among different subsequent definitions of quasi-convexity. We prove some existing notions arise as a special case in the proposed scheme.

[1]  Daishi Kuroiwa,et al.  Convexity for set-valued maps , 1996 .

[2]  Matteo Rocca,et al.  Extended Well-Posedness of Quasiconvex Vector Optimization Problems , 2009 .

[3]  Marius Durea,et al.  Optimality conditions for weak and firm efficiency in set-valued optimization , 2008 .

[4]  Enrico Miglierina,et al.  Well-Posedness and Scalarization in Vector Optimization , 2005 .

[5]  Dirk Lebiedz,et al.  A robust optimization approach to experimental design for model discrimination of dynamical systems , 2011, Math. Program..

[6]  Daishi Kuroiwa Existence theorems of set optimization with set-valued maps , 2003 .

[7]  Douglass J. Wilde,et al.  Foundations of Optimization. , 1967 .

[8]  Daishi Kuroiwa,et al.  On cone of convexity of set-valued maps , 1997 .

[9]  P. Loridan Well-posedness in Vector Optimization , 1995 .

[10]  T. Zolezzi Extended well-posedness of optimization problems , 1996 .

[11]  Extended well-posedness of vector optimization problems: the convex case , 2011 .

[12]  Enrico Miglierina,et al.  Pointwise well-posedness in set optimization with cone proper sets , 2012 .

[13]  Daishi Kuroiwa,et al.  On set-valued optimization , 2001 .

[14]  A. Schöbel,et al.  The relationship between multi-objective robustness concepts and set-valued optimization , 2014 .

[15]  C. Tammer,et al.  Theory of Vector Optimization , 2003 .

[16]  Amir Beck,et al.  Duality in robust optimization: Primal worst equals dual best , 2009, Oper. Res. Lett..

[17]  T. Zolezzi,et al.  Well-Posed Optimization Problems , 1993 .

[18]  G. Jameson Ordered Linear Spaces , 1970 .

[19]  Kok Lay Teo,et al.  Well-posedness for set optimization problems , 2009 .

[20]  Masao Fukushima,et al.  SDP reformulation for robust optimization problems based on nonconvex QP duality , 2012, Computational Optimization and Applications.

[21]  Nicolae Popovici,et al.  Characterizations of convex and quasiconvex set-valued maps , 2003, Math. Methods Oper. Res..

[22]  Matteo Rocca,et al.  Well Posedness in Vector Optimization Problems and Vector Variational Inequalities , 2007 .

[23]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[24]  Fernando Ordóñez,et al.  A robust optimization approach to dispatching technicians under stochastic service times , 2013, Optim. Lett..

[25]  H. Rådström An embedding theorem for spaces of convex sets , 1952 .