检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:席沙沙 魏勇 XI Sha-sha;WEI Yong(College of Mathematics and Information,China West Normal University,Nanchong 637000,China)
机构地区:[1]西华师范大学数学与信息学院
出 处:《数学的实践与认识》2018年第18期201-208,共8页Mathematics in Practice and Theory
基 金:四川省应用基础研究项目(2008JY0112)
摘 要:针对实数情形的灰色关联决策问题,提出了一种选择最优方案的新方法:首先计算出各个方案和理想方案的Lagrange插值多项式,并利用黎曼积分计算出各个方案和理想方案两曲线之间的面积,进而构造接近性关联度,通过比较接近性关联度来选择最优方案.然后针对区间灰数情形,提出分别计算出各方案的下界序列到理想方案的下界序列的接近性关联度,各方案的上界序列到理想方案的上界序列的接近性关联度后再计算两者的新型综合关联度,并通过比较综合关联度来选择最优方案.最后通过实数和区间灰数两个不同的算例来进一步验证了该方法的可行性、合理性和有效性.For the grey relational decision problems in the real number situation, this paper proposes a new method to choose the optimum scheme: Firstly, to calculate the Lagrange interpolation polynomial of each scheme and ideal scheme, and calculate the area between the two curves of each scheme and the ideal scheme by using Riemann integral, construct relation degree of nearness, and through the comparison of relation degree of nearness to choose the optimum scheme. Secondly, for the case of the interval grey number, to calculate relation degree of nearness of the sequence of lower bounds of each scheme to the lower bound of the ideal scheme ,and relation degree of nearness of the sequence of upper bounds of each scheme to the upper bound of the ideal scheme, then calculate the new synthesis degree of grey incident, and by comparing the synthesis degree of grey incident to choose the optimal scheme. Finally, through two different examples of real number and interval grey number to verify the feasibility, reasonable and effective of the method.
关 键 词:灰色系统理论 LAGRANGE插值多项式 接近性关联度 综合关联度 决策模型
分 类 号:N941.5[自然科学总论—系统科学] O174.21[理学—数学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7