Sufficiency and Duality for(h,φ)-Multiobjective Programming with Generalized Convexity

Under the assumptions of two classes of generalized (h,φ)-convex functions,this paper deals with the optimality and duality for (h,φ)-multiobjective programming problem by using analytic method.The sufficient optimality conditions and dual theorems were established for (h,φ)-multiobjective programming problem.