一类广义凸多目标规划的对偶定理

Duality Theorems for a Class of Generalized Convex Multiobjective Programming

本文建立了非凸多目标规划的一个一般对偶模型,并利用Hanson和Mond所提出的广义F-凸性条件建立了关于弱有效解的弱、强和逆对偶定理,另外还讨论了几种特殊情况。本文的结果推广了Egudo和Mond关于单目标非线性规划的一般对偶理论。

We formulate a general duality model for nonconvex multiobjective programming problems. Us- ing the generalized F-convexity conditions given by Hanson and Mond in [5], we establish weak, strong and converse duality theorems for weak efficient solutions. Some special cases are ago dis- cussed. The results of this paper generalize the general duality theory for single objective nonlinear programming discussed by Egudo and Mond in [6].