Multiobjective Program with Support Functions Under(G,C, ρ)-Convexity Assumptions

This paper deals with multiobjective programming problems with support functions under(G, C, ρ)-convexity assumptions. Not only sufficient but also necessary optimality conditions for this kind of multiobjective programming problems are established from a viewpoint of(G, C, ρ)-convexity.When the sufficient conditions are utilized, the corresponding duality theorems are derived for general Mond-Weir type dual program.