[1] Yang X M, Li D, Wang S Y. Near-subconvexlikeness in vector optimization with set-valued functions. J
Optim Theory Appl, 2001, 110: 413-427

[2] Rong Weidong, Wu Yu’nan. Characterizations of super efficiency in cone-convexlike vector optimization
with set-valued maps. Math Meth Oper Res, 1998, 48: 247-258

[3] Borwein J M, Zhuang D M. Super efficiency in vector optimization. Trans Amer Math Soc, 1993, 338:
105-122

[4] Chen G Y, Rong W D. Characterization of the Benson proper efficiency for nonconvex optimization. J
Optim Theory Appl, 1998,98: 365-384

[5] Breckner W W, Kassay G. A systematization of convexity concepts for sets and functions. Journal of
Convex Analysis, 1997, 4: 109-127

[6] Ling Chen. K-T type optimality conditions of multiobjective programming with set-valued maps. J Sys
Sci & Math Sci, 2000, 20: 196-202 (in Chinese)

[7] Li Zemin. The optimality conditions for vector optimization of set-valued maps. J Math Anal Appl, 1999,
237: 413-424

[8] Sheng Baohai, Liu Sanyang. The optimality conditions of nonconvex set valued vector optimization. Acta
Mathematica Scientia, 2002, 22B(1): 47-55

[9] Liu Xianzhong, Hu Shigeng, Liu Jinshan. Minimax theorems for subconvexlike functions with applications
to saddle point problems. Acta Mathematica Scientia, 2002, 22B(1): 115-122

[10 ]Xu Yihong, Liu Sanyang. On strict efficiency in the set-valued optimization with nearly cone-subconvexlikeness.
J Sys Sci & Math Sci, 2004, 24(3): 311-317 (in Chinese)