检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:周婉娜[1] 霍永亮[2] ZHOU Wanna;HUO Yongliang(School of Information Engineering,Xi’an Fanyi University,Xi’an 710105;College of Mathematics and Big Data,Chongqing University of Arts and Sciences,Chongqing 402160,China)
机构地区:[1]西安翻译学院信息工程学院,西安710105 [2]重庆文理学院数学与大数据学院,重庆402160
出 处:《纺织高校基础科学学报》2024年第3期118-124,共7页Basic Sciences Journal of Textile Universities
基 金:陕西省科技厅自然科学基础研究项目(2022JQ-712);西安翻译学院科研项目(23B21)。
摘 要:为研究二层多目标随机规划逼近问题的弱有效解与精确的弱有效解之间的逼近收敛性,针对上、下层都带有约束条件的一类多目标二层随机规划的逼近问题,构建了二层多目标随机规划逼近问题的弱有效解集的上半收敛性理论框架。即在假设下层反馈到上层的最优解集函数为凸函数的前提下,借助严格凸函数的性质,利用多目标随机规划的弱有效解可以表示成相应的单目标随机规划最优解集交集的结构特征,建立了二层多目标随机规划逼近弱有效解集的上半收敛性,提供了逼近方法求解二层多目标随机规划弱有效解集可以近似替代精确的弱有效解集的理论依据。In order to study the convergence of approximation between the exact weakly efficient solution and the weakly efficient solution of the approximation problem of bi-level multi-objective stochastic programming,we construct an upper semi-convergence theoretical framework of weakly efficient solution sets for a class of approximation problems of multi-objective bi-level stochastic programming with both upper and lower constraints.In other words,on the premise of assuming that the optimal solution set function fed back from the lower layer to the upper layer is convex function,using the property of strict convex function,the weakly efficient solution of multi-objective stochastic programming can be expressed as the structural feature of the intersection of the optimal solution set of the corresponding single objective stochastic programming,and the upper semi-convergence of the approximation of the weakly efficient solution set by the bi-level multi-objective stochastic programming is established.This conclusion provides the theorectical basis that approximation weakly effective solution sets can approximately replace the exact weakly effective solution sets in bi-level multi-objective stochastic programming.
关 键 词:单目标随机规划 多目标随机规划 弱有效解集 严格凸函数
分 类 号:O221.5[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.216.137.32