摘要本文在广义(F,α,,ρd)-凸的基础上讨论了混合类型的对偶问题,并获得了弱对偶结果.In the paper, we discussed mixed type dual of （VOP）. Weak duality are obtained under the generalized （F,α,ρ,d）-convexity.
1Weir ,T. and B. Mond ,Generalized convexity and duality in multi-objective programming. Bull. Austral.Math. Soc. ,1989,39: 287--299.
2Egudo, R. , Efficiency and generalized convex duality for multi-objective programs. JMAA, 1989,1311: 84--94.
3Preda, V. ,On efficiency and duality for multi-objective programs. JMAA, 1992,166 : 365-- 377.
4Gulati,T. R. and M. A. Islam,Sufficiency and duality in multi-objective programming involving generalized F-convex functions.JMAA, 1994,183:181-- 195.
5Liang, Z. A. , H. X. Huang, P. M. Pardalos, Optimality conditions and duality for a class of nonlinear fractional programming problem ,JOTA, 2001,110 (3) : 611 -- 619.
1[1]V. Preda, On efficiency and dualty for multiobjective programs, JMAA, 166(1992), 365-377.
2[2]T.R. Gulati and M. A. Islam, Sufficiency and duality in multiobjective programming problems involving generalized F-convex functions, JMAA, 183(1994), 181-195.
3[3]J. P. Vial, Strong and weak convexity set and functions, Math. Oper. Res, 8(1983), 231-259.
4[4]Z. A. Ling, H. X. Huang, P. M. Pardalos, Optimality conditions and duality for a class of nonlinear fractional programming problems, JOTA, 110: 3 (2001), 611-619.
