Abstract
In this paper, saddle point criteria and Wolfe duality theorems are established for a new class of nondifferentiable vector optimization problems with inequality and equality constraints. The results are proved under nondifferentiable (Φ, ρ)-invexity and related scalar and vector-valued Lagrangians defined for the considered nonsmooth multiobjective programming problem. It turns out that the results are established for such vector optimization problems in which not all functions constituting a vector optimization problem possess the fundamental property of invexity and the most of generalized invexity notions previously defined in the literature.