Transitive approximation to pairwise comparison matrices by using interval goal programming
Transitive approximation to pairwise comparison matrices by using interval goal programming
复制标题
DOI：
10.1057/palgrave.jors.2601542
复制
发表时间：
2003-05
影响因子：
3.6
通讯作者：
J. González-Pachón;M. I. Rodríguez-Galiano;C. Romero
中科院分区：
文献类型：
--
作者：
J. González-Pachón;M. I. Rodríguez-Galiano;C. Romero
当无法直接评估对象时，配对比较是一种非常流行的确定对象相对重要性的方法。成对比较方法面临的挑战源于其相关矩阵中缺少一些属性。在本文中，我们关注以下一般问题：给定一个不可逆且不一致的矩阵计算不及物性，其相关排名（由重要性值定义）是什么？我们建议使用不一致作为获取重要性值的信息来源。为此，提出了一种具有分解和聚合阶段的方法。区间目标规划将是实现第二阶段定义的聚合过程的有用工具。
Paired comparison is a very popular method for establishing the relative importance ofnobjects, when they cannot be directly rated. The challenge faced by the pairwise comparison method stems from some missing properties in its associated matrix. In this paper, we focus on the following general problem: given a non-reciprocal and inconsistent matrix computing intransitivities, what is its associated ranking (defined by importance values)? We propose to use inconsistencies as a source of information for obtaining importance values. For this purpose, a methodology with a decomposition and aggregation phase is proposed. Interval Goal Programming will be a useful tool for implementing the aggregation process defined in the second phase.