Well Posedness in Vector Optimization Problems and Vector Variational Inequalities

In this paper, we give notions of well posedness for a vector optimization problem and a vector variational inequality of the differential type. First, the basic properties of well-posed vector optimization problems are studied and the case of C-quasiconvex problems is explored. Further, we investigate the links between the well posedness of a vector optimization problem and of a vector variational inequality. We show that, under the convexity of the objective function f, the two notions coincide. These results extend properties which are well known in scalar optimization. Communicated by F. Giannessi