On lexicographic goal programming method for generating weights from inconsistent interval comparison matrices

被引：28
|
作者：
Wang, YM [1 ]
机构：
[1] Fuzhou Univ, Sch Publ Adm, Fuzhou 350002, Fujian, Peoples R China
[2] Univ Manchester, Manchester Business Sch, Manchester M60 1QD, Lancs, England
来源：
APPLIED MATHEMATICS AND COMPUTATION | 2006年 / 173卷 / 02期
基金：
中国国家自然科学基金; 英国工程与自然科学研究理事会;
关键词：
analytic hierarchy process; interval comparison matrix; weight estimation; goal programming;
D O I：
10.1016/j.amc.2005.04.029
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In a recent paper by [European Journal of Operational Research 97 (1997) 53-62] the lexicographic goal programming (LGP) method was developed to generate weights from inconsistent interval comparison matrices and a number of its properties and advantages as a weight determination technique were explored. It is shown in this paper that LGP is in fact defective in theory. Although the upper and lower triangular judgments of an inconsistent interval comparison matrix provide exactly the same information on the preferences of weights, in general they lead to distinctive priorities and rankings if LGP is used. (c) 2005 Elsevier Inc. All rights reserved.
引用
收藏
页码：985 / 991
页数：7
相关论文
共 50 条
12345