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

被引:103
|
作者
Wang, Ying-Ming
Elhag, Taha M. S.
机构
[1] Univ Manchester, Sch Mech Aerosp & Civil Engn, Project Management Div, Manchester M60 1QD, Lancs, England
[2] Fuzhou Univ, Sch Publ Adm, Fuzhou 350002, Peoples R China
基金
英国工程与自然科学研究理事会; 中国国家自然科学基金;
关键词
analytic hierarchy process; multiple criteria decision making; interval comparison matrix; interval regression analysis; normalization;
D O I
10.1016/j.ejor.2005.10.066
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:458 / 471
页数:14
相关论文
共 50 条