Annals of Operations Research

, Volume 251, Issue 1–2, pp 89–104 | Cite as

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

  • Giovanni P. Crespi
  • Daishi Kuroiwa
  • Matteo Rocca


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.


Robust optimization Optimistic counterpart Vector optimization with uncertain data Set optimization Global well-posedness Quasi-convexity 


  1. Aubin, J. P., & Frankowska, H. (1990). Set-valued analysis. Boston, MA: Birkhåuser.Google Scholar
  2. Bazaraa, M. S., & Shetty, C. M. (1976). Foundations of optimization. Berlin: Springer.CrossRefGoogle Scholar
  3. Beck, A., & Ben-Tal, A. (2009). Duality in robust optimization: Primal worst equals dual best. Operations Ressearch Letters, 37, 1–6.CrossRefGoogle Scholar
  4. Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. (2009). Robust optimization. Princeton, US: Princeton University Press.CrossRefGoogle Scholar
  5. Ben-Tal, A., & Nemirovski, A. (1998). Robust convex optimization. Mathematics of Operations Research, 23, 769–805.CrossRefGoogle Scholar
  6. Benoist, J., & Popovici, N. (2003). Characterization of convex and quasiconvex set-valued maps. Mathematical Methods of Operations Research, 57, 427–435.CrossRefGoogle Scholar
  7. Crespi, G. P., Papalia, M., & Rocca, M. (2011). Extended well-posedness of vector optimization problems: The convex case. Taiwanese Journal of Mathematics, 15, 1545–1559.Google Scholar
  8. Crespi, G. P., Papalia, M., & Rocca, M. (2009). Extended well-posedness of quasiconvex vector optimization problems. Journal of Optimization Theory and Applications, 141, 285–297.CrossRefGoogle Scholar
  9. Crespi, G. P., Guerraggio, A., & Rocca, M. (2007). Well-posedness in vector optimization problems and variational inequalities. Journal of Optimization Theory and Applications, 132, 213–226.CrossRefGoogle Scholar
  10. Dontchev, A. L., & Zolezzi, T. (1993). Well-posed optimization problems. Berlin: Springer.CrossRefGoogle Scholar
  11. Durea, M. (2008). Optimality condition for weak and firm efficiency in set-valued optimization. Journal of Mathematical Analysis and Applications, 344, 1018–1028.CrossRefGoogle Scholar
  12. Gutiérrez, G., Miglierina, E., Molho, E., & Novo, V. (2012). Pointwise well-posedness in set optimization with cone proper sets. Nonlinear Analysis, 75, 1822–1833.CrossRefGoogle Scholar
  13. Ide, J., Köbis, E., Kuroiwa, D, Schöbel, A., & Tammer, C., (2013). The relation between multicriteria robustness concepts and set valued optimization.
  14. Jameson, G. (1970). Ordered linear spaces, Lecture Notes in Mathematics (Vol. 141). Berlin: Springer.CrossRefGoogle Scholar
  15. Kuroiwa, D. (2011). Set optimization with DC objective function. In S. Akashi, D. S. Kim, T. H. Kim, G. M. Lee, W. Takahashi, & T. Tanaka (Eds.), Nonlinear and convex analysis (pp. 291–297) Yokohama: Yokohama.Google Scholar
  16. Kuroiwa, D. (2009). On derivatives and convexity of set-valued maps and optimality conditions in set optimization. Journal of Nonlinear and Convex Analysis, 1, 41–50.Google Scholar
  17. Kuroiwa, D., & Nuriya, T. (2006). A generalized embedding vector space in set optimization In :Proceedings of the forth international conference on nonlinear and convex analysis (pp. 297–304).Google Scholar
  18. Kuroiwa, D. (2003). Existence theorems of set optimization with set-valued maps. Journal of Information and Optimization sciences, 1, 73–84.CrossRefGoogle Scholar
  19. Kuroiwa, D. (2001). On set-valued optimization. Nonlinear Analysis, 47, 1395–1400.CrossRefGoogle Scholar
  20. Kuroiwa, D., Tanaka, T., & Duc Ha, T. X. (1997). On cone convexity for set-valued maps. Nonlinear Analysis, 30, 1487–1496.CrossRefGoogle Scholar
  21. Kuroiwa, D. (1996). Convexity for set-valued maps. Applied Mathematics Letters, 9, 97–101.CrossRefGoogle Scholar
  22. Loridan, P. (1995). Well-posedness in vector optimization. Mathematics and its Applications, 331, 171–192.Google Scholar
  23. Luc, D. T. (1989). Theory of vector optimization. Berlin: Springer.CrossRefGoogle Scholar
  24. Miglierina, E., Molho, E., & Rocca, M. (2005). Well-posedness ad scalarization in vector optimization. Journal of Optimization Theory and Applications, 126, 391–409.CrossRefGoogle Scholar
  25. Nishimura, R., Hayashi, S., & Fukushima, M. (2013). SDP reformulation for robust optimization problems based on nonconvex QP duality. Computational Optiization and Applications, 55, 21–47.CrossRefGoogle Scholar
  26. Rådström, H. (1952). An embedding theorem for spaces of convex sets. Proceedings of the American mathematical society, 3, 165–169.CrossRefGoogle Scholar
  27. Skanda, D., & Lebiedz, D. (2013). A robust optimization approach to experimental design for model discrimination of dynamical systems. Mathematical Programming, 141(Ser. A), 405–433.CrossRefGoogle Scholar
  28. Souyris, S., Cortés, C. E., Ordóñez, F., & Weintraub, A. (2013). A robust optimization approach to dispatching technicians under stochastic service times. Optimization Letters, 7, 1549–1568.CrossRefGoogle Scholar
  29. Zhang, W. Y., Li, S. J., & Teo, K. L. (2009). Well-posedness for set optimization problems. Nonlinear Analysis, 71, 3769–3778.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • Giovanni P. Crespi
    • 1
  • Daishi Kuroiwa
    • 2
  • Matteo Rocca
    • 3
  1. 1.Department of EconomicsUniversità degli Studi dell’InsubriaVareseItaly
  2. 2.Department of MathematicsShimane UniversityMatsueJapan
  3. 3.Department of EconomicsUniversità degli Studi dell’InsubriaVareseItaly

Personalised recommendations