  The purpose of this paper is to characterize the weak efficient solutions,
the efficient solutions, and the isolated efficient solutions of a given vector
optimization problem with finitely many convex objective functions and
infinitely many convex constraints. To do this, we introduce new and already
known data qualifications (conditions involving the constraints and/or the
objectives) in order to get optimality conditions which are expressed in terms
of either Karusk-Kuhn-Tucker multipliers or a new gap function associated with
the given problem.
