The logarithmic least squares priorities and ordinal violations in the best-worst method
arxiv(2023)
摘要
The best-worst method is an increasingly popular approach to solve
multi-criteria decision-making problems. However, the usual prioritisation
techniques may result in ordinal violations if the best (worst) alternative
identified in an early step does not receive the highest (lowest) weight in a
later step. The current paper gives two sufficient conditions for the
logarithmic least squares method, applied to the implied incomplete best-worst
method matrix, to guarantee the lack of ordinal violations. Our results provide
another powerful argument for using the logarithmic least squares priorities in
the best-worst method.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要