广义凸(h,φ)-多目标规划的充分性和对偶性

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

在两类(h,φ)-广义凸函数的假设下,用分析方法研究(h,φ)-多目标规划的最优性条件和对偶问题,得到了一些充分最优性条件和对偶定理.

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,φ）-muhiobjective programming problem.