Second-order optimality conditions for nondominated solutions of multiobjective programming with $C^{1,1}$ data

summary:We examine new second-order necessary conditions and sufficient conditions which characterize nondominated solutions of a generalized constrained multiobjective programming problem. The vector-valued criterion function as well as constraint functions are supposed to be from the class $C^{1,1}$. Second-order optimality conditions for local Pareto solutions are derived as a special case