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 p...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.展开更多
基金supported by the Natural Science Foundation of Guangdong Province under Grant No.S2013010013101the Science Foundations of Hanshan Normal University under Grant Nos.QD20131101and LZ201403
文摘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.
