检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:凌晨[1]
出 处:《运筹学学报》2004年第3期19-28,共10页Operations Research Transactions
摘 要:本文研究拓扑空间中锥拟凸多目标优化问题的有效解集的连通性.在目标映射是上连续和拟凸(次严格拟凸)的条件下,证明了锥弱有效(有效)解集是连通的.进一步,在是连续和强拟凸的条件下,证明了锥有效解集是路连通的.In this paper, we prove that the cone weak efficient (cone efficient) solution set is connected under the condition that the objective mapping / is continuous and K-quasiconvex ( K-secondary strictly quasiconvex ) on A, in general topological vector spaces. Further, we also prove that cone efficient solution set is path connected under the condition that the objective mapping f is continuous and K-strong quasiconvex on A.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3