期刊
ANNALS OF OPERATIONS RESEARCH
卷 274, 期 1-2, 页码 57-74出版社
SPRINGER
DOI: 10.1007/s10479-018-2888-x
关键词
Pairwise comparisons; Shortest Path Problem; Network Simplex method; Pareto efficiency
资金
- National Science Center [DEC-2011/01/D/HS4/03543]
- OTKA Grant [111797]
In several multiobjective decision problems Pairwise Comparison Matrices (PCM) are applied to evaluate the decision variants. The problem that arises very often is the inconsistency of a given PCM. In such a situation it is important to approximate the PCM with a consistent one. One of the approaches is to minimize the distance between the matrices, most often the Euclidean distance. In the paper we consider the problem of minimizing the maximum distance. After applying the logarithmic transformation we are able to formulate the obtained subproblem as a Shortest Path Problem and solve it more efficiently. We analyze the structure of the set of optimal solutions and prove some of its properties. This allows us to provide an iterative algorithm that results in a unique, Pareto-efficient solution.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据