Duality Theorems of Multiobjective Programming for a Class of Generalized Convex Functions

Abstract

Many important achievement of multiobjective programming are all based on convex programming. How to extend and deepen them, one vital aspect is extend the convexity functions which are refered in various sense to more general convexity functions. In this paper, a class of generalized convexity fuctions: (F, ρ )-invariant convex function, (F, ρ)- invariant quasiconvex function, (F, ρ )-invariant pseudoconvex function and (F, ρ )-strictly invariant pseudoconvex function are defined. On the basis of definitions, we have constructed general duality models (VD); discussed duality property of (VP) and (VD); proved weakly duality theorem, direct duality theorem and converse duality theorem. The functions of a class of generalized convexity are extension of the several different generalized convexity functions presented in the references [1], [2], [3], [4], and [5]. The results of this paper can be thought of as improved extended and generalized of the main results of the references [1]~[10].