A Linear Goal Programming Method for Calculating Weights in the Interval AHP
Mu Zeng
Abstract
Mu Zeng
Abstract
Based on the incorporation differences between actual interval and judgment interval given by the experts' pairwise comparison, the problem of calculating weights in the interval AHP is studied in three aspects. And on the basis of the solution to a linear goal programming three new algorithms for the interval weight of each alternative derived from interval judgment matrix are proposed respectively. Finally, the effectiveness of these algorithms is illustrated by the solution to a practical example.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Based on the incorporation differences between actual interval and judgment interval given by the experts' pairwise comparison, the problem of calculating weights in the interval AHP is studied in three aspects. And on the basis of the solution to a linear goal programming three new algorithms for the interval weight of each alternative derived from interval judgment matrix are proposed respectively. Finally, the effectiveness of these algorithms is illustrated by the solution to a practical example.
Key concepts: Analytic hierarchy process, Interval (graph theory), Pairwise comparison, Goal programming, Linear programming, Mathematical optimization, Matrix (chemical analysis), Basis (linear algebra)