A systematization of global well-posedness in vector optimization

Abstract In this paper we give a systematization of global well-posedness in vector optimization. We investigate the links among global notions of well-posedness for a vector optimization problem (see e.g. Miglierina et al. in J Optim Theory Appl 126:391–409, 2005 for a detailed explanation of the difference between pointwise and global well-posedness in vector optimization). In particular we compare several notions of global well-posedness referring to efficient solutions, weakly efficient solutions and properly efficient solutions of a vector optimization problem. We also establish scalar characterizations of global vector well-posedness. Finally we study global well-posedness of vector cone-convex functions.