检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:钟丽明 范江华 ZHONG Liming;FAN Jianghua(School of Mathematics and Statistics,Guangxi Normal University,Guilin Guangxi 541006,China)
机构地区:[1]广西师范大学数学与统计学院,广西桂林541006
出 处:《广西师范大学学报(自然科学版)》2021年第3期62-68,共7页Journal of Guangxi Normal University:Natural Science Edition
基 金:国家自然科学基金(71561004);广西研究生教育创新计划(XYCSZ2020062)。
摘 要:研究向量优化问题解集的连通性。利用标量化方法,讨论了无界闭凸集上凸向量优化问题弱有效解集的连通性。在向量值函数为锥下半连续、锥凸时,运用极锥的紧凸基的连通性,证明了解集映射是上半连续映射,从而得到解集的连通性;在向量值函数为锥下半连续、锥严格凸时,得到了凸向量优化问题弱有效解集的道路连通性;得到了复合多目标规划问题的弱有效解集与仿射向量变分不等式问题弱有效解集的连通性。The connectedness of solution sets for vector optimization problems is studied in this paper.By means of the scalarization method,the connectedness of weakly efficient solutions sets for convex vector optimization problems on the unbounded,closed and convex sets are discussed.When the vector valued mapping is cone-lowersemicontinuous and cone-convex,the mapping of solution sets is proved to be upper semicontinuous and the connectedness of solution set by using the connectedness of the compact and convex base of the polar cone is established.When the vector valued mapping is cone-lowersemicontinuous and strictly cone-convex,the path-connectedness of solution sets of convex vector optimization problems are obtained.Furthermore,the connectedness of weakly efficient solutions sets of composite multiobjective optimization problems and the connectedness of solution sets of affine vector variational inequality problems are obtained.
关 键 词:向量优化问题 弱有效解 非空紧致集 连通性 道路连通性
分 类 号:O224.1[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49