Abstract
Crisp comparison matrices lead to crisp weight vectors being generated. Accordingly, an interval comparison matrix should give an interval weight estimate. In this paper, a goal programming (GP) method is proposed to obtain interval weights from an interval comparison matrix, which can be either consistent or inconsistent. The interval weights are assumed to be normalized and can be derived from a GP model at a time. The proposed GP method is also applicable to crisp comparison matrices. Comparisons with an interval regression analysis method are also made. Three numerical examples including a multiple criteria decision-making (MCDM) problem with a hierarchical structure are examined to show the potential applications of the proposed GP method.
Original language | English |
---|---|
Pages (from-to) | 458-471 |
Number of pages | 14 |
Journal | European Journal of Operational Research |
Volume | 177 |
Issue number | 1 |
DOIs | |
Publication status | Published - 16 Feb 2007 |
Keywords
- Analytic hierarchy process
- Interval comparison matrix
- Interval regression analysis
- Multiple criteria decision making
- Normalization
ASJC Scopus subject areas
- General Computer Science
- Modelling and Simulation
- Management Science and Operations Research
- Information Systems and Management