arrow
返回

A goal programming method for obtaining interval weights from an interval comparison matrix

delete2007-02-01
delete122
PRE
AI
王
王应明 (Ying‐Ming Wang) *
T
Taha Elhag
DOI:10.1016/j.ejor.2005.10.066delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Crisp comparison matrices lead to crisp weight vectors being generated. Accordingly, an interval comparison matrix should give an interval weight estimate. In this paper, a goal programming (GP) method is proposed to obtain interval weights from an interval comparison matrix, which can be either consistent or inconsistent. The interval weights are assumed to be normalized and can be derived from a GP model at a time. The proposed GP method is also applicable to crisp comparison matrices. Comparisons with an interval regression analysis method are also made. Three numerical examples including a multiple criteria decision-making (MCDM) problem with a hierarchical structure are examined to show the potential applications of the proposed GP method. (c) 2006 Elsevier B.V. All rights reserved.
Keyword:
analytic hierarchy process
multiple criteria decision making
interval comparison matrix
interval regression analysis
normalization
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

European Journal of Operational Research 封面图
European Journal of Operational Research
IF:
6
论文数:
2.2W
被引数:
6.4W

机构

暂无机构信息
引用论文

引用论文

学者 查看更多内容