Abstract: 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.

Key words: multiobjective programming, (h,φ)typeⅠ, quasi (h,φ)typeⅠ, duality