Deriving the partial values in MCDM by goal programming

Deriving the partial values in MCDM by goal programming

0.00 Avg rating0 Votes
Article ID: iaor19981877
Country: Netherlands
Volume: 74
Issue: 1
Start Page Number: 277
End Page Number: 288
Publication Date: Nov 1997
Journal: Annals of Operations Research
Authors: , ,
Keywords: programming: multiple criteria, analytic hierarchy process
Abstract:

Preference for a set of alternatives evaluated under multiple criteria is frequently expressed in the form of pairwise comparisons. We propose a linear goal programming model for deriving the partial and overall preference values of the alternatives directly from pairwise comparisons. This model can be a useful alternative to the analytic hierarchy process. The partial values represent the contribution of the criteria to the overall preference. Simulation experiments, which are conducted to compare the performance of the model with that of two other existing models, show that the model has good performance.

Reviews

Required fields are marked *. Your email address will not be published.