Abstract
In this paper by employing an asymptotic approach we develop an existence and stability theory for convex multiobjective programming. We deal with the set of weakly efficient minimizers. To this end we employ a notion of convergence for vector-valued functions close to that due to Lemaire.