Abstract
We discuss necessary and sucient conditions of optimality for nonsmooth and smooth continuous-time multiobjective optimization problems under generalized convexity assumptions.
Keywords: multiobjective continuous-time programming, invexity, pseudoinvexity, optimality conditions, ecient solutions, generalized gradient.