When characterizing optimal solutions of both scalar
and vector optimization problems usually constraint qualifications
have to be satisfied. By considering sequential characterizations,
given for the first time in vector optimization in this paper, this
drawback is eliminated. In order to establish them we give first of
all sequential characterizations for a convex composed optimization
problem with geometric and cone constraints. Then, by means of
scalarization, we extend them to the vectorial case. For
exemplification we particularize the characterization in the case of
linear and
set scalarization.