摘要
针对群决策中基于语言判断矩阵形式偏好信息的方案排序问题,提出一种新的排序方法。给出有关语言判断矩阵的完全一致性、满意一致性、LOW A算子及图论的连通图和树等若干定义,得出构造具有完全一致性或满意一致性的语言判断矩阵满足的条件。根据图论的无向连通图理论,给出基于语言判断矩阵的群决策的方案排序方法。通过一个算例说明本文提出的分析方法。
With respect to the problem of linguistic preference information, this paper proposes a new ranking method. First, the several concepts of linguistic judgment matrices, complete consistency; satisfied consistency; operator of LOWA; connected graph and tree of graph theory are introduced, the condition is obtained that the linguistic judgment matrices have complete consistency or weak consistency. Then, a ranking approach to linguistic judgment matrix is also given based on the defining of undirected connected graph in graph theory. Finally, a numerical example is given to illustrate the use of the method proposed in this paper.
出处
《系统工程》
CSCD
北大核心
2009年第12期90-94,共5页
Systems Engineering
基金
国家创新研究群体科学基金资助项目(70721001)
航空基金资助项目(2008ZG54023)
辽宁省自然科学基金资助项目(20092053)
中国博士后科学基金资助项目(20070421057)
关键词
群决策
语言判断矩阵
LOWA算子
图论
Group Decision-making
Linguistic Judgment Matrices
Operator of LOWA
Graph Theory