Conic efficiency and duality in nondifferentiable multiobjective mathematical programming

The aim of this paper is to study nondifferentiable constrained multiobjective programs where the partial order in the image space is induced by a closed, convex pointed solid cone C. In particular, a new necessary optimality condition is stated for C-efficient and C-weakly efficient solutions. Assumptions guaranteeing that every weak critical point is a C-efficient or C-weakly efficient solution are investigated, improving in an unifying framework many definitions and results appeared in the recent vector optimization literature. Finally, some weak, strong and converse duality results are stated