.png){kind=icon}
返回
Preference programming and inconsistent interval judgments
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(95)00377-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem of derivation of the weights of alternatives from pairwise comparison matrices is long standing. In this paper, Lexicographic Goal Programming (LGP) has been used to fmd out weights from pairwise inconsistent interval judgment matrices. A number of properties and advantages of LGP as a weight determination technique have been explored. An algorithm for identification and modification of inconsistent bounds is also provided. The proposed technique has been illustrated by means of numerical examples.
Keyword:
analytic hierarchy process
interval judgment
preference programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
分享收藏How similar are commonly combined criteria for EDSS progression in multiple sclerosis?多发性硬化症中EDSS进展的常见综合标准有多相似？
PREAI
分享收藏分享收藏
查看更多内容