检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王俊林[1]
出 处:《佳木斯大学学报(自然科学版)》2012年第1期124-126,131,共4页Journal of Jiamusi University:Natural Science Edition
摘 要:对概率约束规划逼近最优解集序列的几乎处处上半收敛性进行讨论.利用概率测度方法建立随机规划模型,将带有约束的随机规划问题转化成与其等价的无约束随机规划问题.以概率测度弱收敛的性质给出概率约束规划可行解的几乎处处收敛性条件,得到概率约束规划逼近最优解集序列的几乎处处上半收敛性.In this paper the author discussed the optimal solution set programs with the almost everywhere upper Semiconvergence. Using probab sequence of probabilistic constrained ility measure method to establish ap- proximation stochastic programming problems model, the stochastic programming problems with constraints were converted into equivalents unconstrained stochastic programming problems. And with the weak convergence prop- erties of probability measure, the conditions of almost everywhere convergence to the feasible solution of probabil- ity constrained programming were given. The almost everywhere upper semiconvergence of the optimal solution set sequence of probabilistic constrained programs was obtained.
关 键 词:概率约束规划 弱收敛 最优解集序列 乎处处上图收敛 乎处处上半收敛
分 类 号:O221.5[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.171