Based on the concept of multiplicative fuzzy consistent complementary judgement matrix, the mixed least square method （MLSM） for priority of complementary judgement matrix is proposed and proved. Then, the correspon...Based on the concept of multiplicative fuzzy consistent complementary judgement matrix, the mixed least square method （MLSM） for priority of complementary judgement matrix is proposed and proved. Then, the corresponding convergent iterative algorithm is given and its convergence is proved. Finally, some main properties of the developed priority method, such as rank preservation under strong condition, etc., ate introduced. The theoretical analyses show that the MLSM can sufficiently reflect the preference information of the decision maker, and is easy to realize on a computer.展开更多
This paper proposes a class of generalized mixed least square methods(GMLSM) forthe estimation of weights in the analytic hierarchy process and studies their good properties such asinvariance under transpose, invarian...This paper proposes a class of generalized mixed least square methods(GMLSM) forthe estimation of weights in the analytic hierarchy process and studies their good properties such asinvariance under transpose, invariance under change of scale, and also gives a simple convergent iterativealgorithm and some numerical examples. The well-known eigenvector method(EM) is then compared.Theoretical analysis and the numerical results show that the iterative times of the GMLSM are generallyfewer than that of the MLSM, and the GMLSM are preferable to the EM in several important respects.展开更多
基金The Project of Shaanxi Provincial Natural Science Foundation of China (No.2004A05)the Project of Science and Research Foundation of Education Committee of Shaanxi Province (No.06JK324)
文摘Based on the concept of multiplicative fuzzy consistent complementary judgement matrix, the mixed least square method （MLSM） for priority of complementary judgement matrix is proposed and proved. Then, the corresponding convergent iterative algorithm is given and its convergence is proved. Finally, some main properties of the developed priority method, such as rank preservation under strong condition, etc., ate introduced. The theoretical analyses show that the MLSM can sufficiently reflect the preference information of the decision maker, and is easy to realize on a computer.
文摘This paper proposes a class of generalized mixed least square methods(GMLSM) forthe estimation of weights in the analytic hierarchy process and studies their good properties such asinvariance under transpose, invariance under change of scale, and also gives a simple convergent iterativealgorithm and some numerical examples. The well-known eigenvector method(EM) is then compared.Theoretical analysis and the numerical results show that the iterative times of the GMLSM are generallyfewer than that of the MLSM, and the GMLSM are preferable to the EM in several important respects.
