Preference programming and inconsistent interval matrices
AbstractThe problem of derivation of the weights of altematives from pairwise comparison matrices is long standing. In this paper,Lexicographic Goal Programming (LGP) has been used to find out weights from pairwise inconsistent interval judgment matrices. A number of properties and advantages of LGP as a weight determination technique have been explored. An algorithm for identification and modification of inconsistent bounds is also provided. The proposed technique has been illustrated by means of numerical examples.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by University Library of Munich, Germany in its series MPRA Paper with number 10129.
Date of creation: 1995
Date of revision: 1995
Publication status: Published in European Journal of Operational Research 1.97(1997): pp. 53-62
Analytic hierarchy process; Interval judgment; Preferente programming;
Find related papers by JEL classification:
- C0 - Mathematical and Quantitative Methods - - General
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Saaty, Thomas L. & Vargas, Luis G., 1987. "Uncertainty and rank order in the analytic hierarchy process," European Journal of Operational Research, Elsevier, vol. 32(1), pages 107-117, October.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ekkehart Schlicht).
If references are entirely missing, you can add them using this form.