Sufficiency and duality in differentiable multiobjective programming involving generalized type I functions

In this paper, new classes of generalized (<f>F,α,ρ,d</f>)-type I functions are introduced for differentiable multiobjective programming. Based upon these generalized functions, first, we obtain several sufficient optimality conditions for feasible solution to be an efficient or weak efficient solution. Second, we prove weak and strong duality theorems for mixed type duality. [Copyright &y& Elsevier]