Connectedness of Cone-efficient Solution Set for Cone-quasiconvex Multiobjective Programming in Hausdorff Topological Vector Spaces  

作　　者：ZHOU Xuan-wei 

机构地区：[1]School of Mathematics and Information Science, Wenzhou University, Wenzhou 325035, China

出　　处：《Chinese Quarterly Journal of Mathematics》2010年第1期132-139,共8页数学季刊（英文版）

基　　金：Foundation item： Supported by the National Natural Science Foundation of China（70071026）

摘　　要：This paper deals with the connectedness of the cone-efficient solution set for vector optimization in locally convex Hausdorff topological vector spaces. The connectedness of the cone-efficient solution set is proved for multiobjective programming defined by a continuous one-to-one cone-quasiconvex mapping on a compact convex set of alternatives. During the proof, the generalized saddle theorem plays a key role.

关 键 词：multiobjective programming cone-efficient solution cone-quasiconvex mapping generalized saddle theorem connectedness 

分 类 号：O221.6[理学—运筹学与控制论]