摘要
研究语言判断矩阵的乘性一致性及方案排序问题。首先给出有关语言判断矩阵和互反判断矩阵的定义及其性质,提出语言判断矩阵一致性的定义;然后通过引进导出矩阵将语言判断矩阵转换为数值矩阵,得出语言判断矩阵具有完全一致性或弱一致性的充要条件是其转换后得到的导出矩阵也具有同样的结论。同时利用该转换公式,给出基于语言判断矩阵的方案排序方法。最后,通过一个算例说明文中提出的分析方法。
This paper has studied the consistency of multiplication and ranking problem based on linguistic judgment matrix. First, several concepts and characters of linguistic judgment matrices and multiplicative judgment matrices were introduced, a concept of the consistency for linguistic judgment matrix is proposed; furthermore, transforming judgment matrix with linguistic assessment information into digital matrix through introducing the educed matrices, a conclusion is obtained that the linguistic judgment matrix is complete consistent or weak consistent if and only if the educed matrix is same also. Meanwhile,a ranking approach to linguistic judgment matrix was also given based on the transforming formula. Finally ,a numerical example was given to illustrate the use of the proposed in this paper.
出处
《系统工程》
CSCD
北大核心
2007年第2期106-110,共5页
Systems Engineering
基金
国家杰出青年科学基金资助项目(70525002)
国家自然科学基金资助项目(70371050)
教育部高等学校优秀青年教师教学科研奖励计划资助项目(教人司[2002]123)
教育部高等学校博士学科点专项科研基金资助项目(20040145018)
关键词
语言判断矩阵
互反判断矩阵
完全一致性
满意一致性
导出矩阵
Linguistic Judgment Matrix
Multiplicative Judgment Matrix
Complete Consistency
Satisfied Consistency
Educed Matrix