Generalized Univex Functions in Nonsmooth Multiobjective Optimization

In this paper, we have considered a nonsmooth multiobjective optimization problem where the objective and constraint functions involved are directionally differentiable. A new class of generalized functions (d???ρ???η???θ)-type I univex is introduced which generalizes many earlier classes cited in literature. Based upon these generalized functions, we have derived weak, strong, converse and strict converse duality theorems for mixed type multiobjective dual program in order to relate the efficient and weak efficient solutions of primal and dual problem.