A new data envelopment analysis method for priority determination and group decision making in the analytic hierarchy process

The DEAHP method for weight deviation and aggregation in the analytic hierarchy process (AHP) has been found flawed and sometimes produces counterintuitive priority vectors for inconsistent pairwise comparison matrices, which makes its application very restrictive. This paper proposes a new data envelopment analysis (DEA) method for priority determination in the AHP and extends it to the group AHP situation. In this new DEA methodology, two specially constructed DEA models that differ from the DEAHP model are used to derive the best local priorities from a pairwise comparison matrix or a group of pairwise comparison matrices no matter whether they are perfectly consistent or inconsistent. The new DEA method produces true weights for perfectly consistent pairwise comparison matrices and the best local priorities that are logical and consistent with decision makers (DMs)’ subjective judgments for inconsistent pairwise comparison matrices. In hierarchical structures, the new DEA method utilizes the simple additive weighting (SAW) method for aggregation of the best local priorities without the need of normalization. Numerical examples are examined throughout the paper to show the advantages of the new DEA methodology and its potential applications in both the AHP and group decision making.     

A heuristic method to rectify intransitive judgments in pairwise comparison matrices

This paper investigates the effects of intransitive judgments on the consistency of pairwise comparison matrices. Statistical evidence regarding the occurrence of intransitive judgements in pairwise matrices of acceptable consistency is gathered by using a Monte-Carlo simulation, which confirms that relatively high percentage of comparison matrices, satisfying Saaty’s CR criterion are ordinally inconsistent. It is also shown that ordinal inconsistency does not necessarily decrease in the group aggregation process, in contrast with cardinal inconsistency. A heuristic algorithm is proposed to improve ordinal consistency by identifying and eliminating intransitivities in pairwise comparison matrices. The proposed algorithm generates near-optimal solutions and outperforms other tested approaches with respect to computation time.     

A fuzzy programming method for deriving priorities in the analytic hierarchy process

The estimation of the priorities from pairwise comparison matrices is the major constituent of the Analytic Hierarchy Process (AHP). The priority vector can be derived from these matrices using different techniques, as the most commonly used are the Eigenvector Method (EVM) and the Logarithmic Least Squares Method (LLSM). In this paper a new Fuzzy Programming Method (FPM) is proposed, based on geometrical representation of the prioritisation process. This method transforms the prioritisation problem into a fuzzy programming problem that can easily be solved as a standard linear programme. The FPM is compared with the main existing prioritisation methods in order to evaluate its performance. It is shown that it possesses some attractive properties and could be used as an alternative to the known prioritisation methods, especially when the preferences of the decision-maker are strongly inconsistent.     

Inferring consensus weights from pairwise comparison matrices without suitable properties

Pairwise comparison is a popular method for establishing the relative importance of n objects. Its main purpose is to get a set of weights (priority vector) associated with the objects. When the information gathered from the decision maker does not verify some rational properties, it is not easy to search the priority vector. Goal programming is a flexible tool for addressing this type of problem. In this paper, we focus on a group decision-making scenario. Thus, we analyze different methodologies for getting a collective priority vector. The first method is to aggregate general pairwise comparison matrices (i.e., matrices without suitable properties) and then get the priority vector from the consensus matrix. The second method proposes to get the collective priority vector by formulating an optimization problem without determining the consensus pairwise comparison matrix beforehand.     

Fuzzified AHP in the evaluation of scientific monographs

Fuzzification of the analytic hierarchy process (AHP) is of great interest to researchers since it is a frequently used method for coping with complex decision making problems. There have been many attempts to fuzzify the AHP. We focus particularly on the construction of fuzzy pairwise comparison matrices and on obtaining fuzzy weights of objects from them subsequently. We review the fuzzification of the geometric mean method for obtaining fuzzy weights of objects from fuzzy pairwise comparison matrices. We illustrate here the usefulness of the fuzzified AHP on a real-life problem of the evaluation of quality of scientific monographs in university environment. The benefits of the presented evaluation methodology and its suitability for quality assessment of R&D results in general are discussed. When the task of quality assessment in R&D is considered, an important role is played by peer-review evaluation. Evaluations provided by experts in the peer-review process have a high level of subjectivity and can be expected in a linguistic form. New decision-support methods (or adaptations of classic methods) well suited to deal with such inputs, to capture the consistency of experts’ preferences and to restrict the subjectivity to an acceptable level are necessary. A new consistency condition is therefore defined here to be used for expertly defined fuzzy pairwise comparison matrices.     

A geometric averaging procedure for constructing supertransitive approximation to binary comparison matrices

The usefulness of encoding the fuzzy evaluations of alternatives and the importance weights of criteria, in a multiple objective decision problem through binary comparison matrices (or pairwise judgment matrices) is receiving considerable attention. The methodology for identifying the best alternative in a given decision problem involves the computation of the principal eigenvectors of the binary comparison matrices. The eigenvectors transform the fuzzy evaluations of the importance of the criteria and the ratings of the alternatives into a ratio scale. A difficulty that is often experienced in using this approach in practice, is the inconsistency of the binary evaluations. This paper proposes a simple averaging procedure to construct a supertransitive approximation to a binary comparison matrix, where inconsistency is a problem. It is further suggested that such an adjustment might be necessary to more closely reflect the inherent fuzziness of the evaluations contained in a binary comparison matrix. The procedure is illustrated by means of examples.     

A goal programming method for obtaining interval weights from an interval comparison matrix

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.     

Fuzzy hierarchical analysis

This paper extends hierarchical analysis to the case where the participants are allowed to employ fuzzy ratios in place of exact ratios. If a person considers alternative A more important than alternative B, then the ratio used might be approximately 3 to 1, or between 2 to 1, and 4 to 1, or at most 5 to 1. The pairwise comparison of the issues and the criteria in the hierarchy produce fuzzy positive reciprocal matrices. The geometric mean method is employed to calculate the fuzzy weights for each fuzzy matrix, and these are combined in the usual manner to determine the final fuzzy weights for the alternatives. The final fuzzy weights are used to rank the alternatives from highest to lowest. The highest ranking contains all the undominated issues. The procedure easily extends to the situation where many experts are utilized in the ranking process, or to the case of missing data. Two examples are presented showing the final fuzzy weights and the final ranking.     

Fuzzy analytic hierarchy process: A logarithmic fuzzy preference programming methodology

Fuzzy analytic hierarchy process (AHP) proves to be a very useful methodology for multiple criteria decision-making in fuzzy environments, which has found substantial applications in recent years. The vast majority of the applications use a crisp point estimate method such as the extent analysis or the fuzzy preference programming (FPP) based nonlinear method for fuzzy AHP priority derivation. The extent analysis has been revealed to be invalid and the weights derived by this method do not represent the relative importance of decision criteria or alternatives. The FPP-based nonlinear priority method also turns out to be subject to significant drawbacks, one of which is that it may produce multiple, even conflict priority vectors for a fuzzy pairwise comparison matrix, leading to entirely different conclusions. To address these drawbacks and provide a valid yet practical priority method for fuzzy AHP, this paper proposes a logarithmic fuzzy preference programming (LFPP) based methodology for fuzzy AHP priority derivation, which formulates the priorities of a fuzzy pairwise comparison matrix as a logarithmic nonlinear programming and derives crisp priorities from fuzzy pairwise comparison matrices. Numerical examples are tested to show the advantages of the proposed methodology and its potential applications in fuzzy AHP decision-making.     

On the extraction of weights from pairwise comparison matrices

We study properties of weight extraction methods for pairwise comparison matrices that minimize suitable measures of inconsistency, ‘average error gravity’ measures, including one that leads to the geometric row means. The measures share essential global properties with the AHP inconsistency measure. By embedding the geometric mean in a larger class of methods we shed light on the choice between it and its traditional AHP competitor, the principal right eigenvector. We also suggest how to assess the extent of inconsistency by developing an alternative to the Random Consistency Index, which is not based on random comparison matrices, but based on judgemental error distributions. We define and discuss natural invariance requirements and show that the minimizers of average error gravity generally satisfy them, except a requirement regarding the order in which matrices and weights are synthesized. Only the geometric row mean satisfies this requirement also. For weight extraction we recommend the geometric mean.     

Estimation of missing judgments in AHP pairwise matrices using a neural network-based model

Selecting relevant features to make a decision and expressing the relationships between these features is not a simple task. The decision maker must precisely define the alternatives and criteria which are more important for the decision making process. The Analytic Hierarchy Process (AHP) uses hierarchical structures to facilitate this process. The comparison is realized using pairwise matrices, which are filled in according to the decision maker judgments. Subsequently, matrix consistency is tested and priorities are obtained by calculating the matrix principal eigenvector. Given an incomplete pairwise matrix, two procedures must be performed: first, it must be completed with suitable values for the missing entries and, second, the matrix must be improved until a satisfactory level of consistency is reached. Several methods are used to fill in missing entries for incomplete pairwise matrices with correct comparison values. Additionally, once pairwise matrices are complete and if comparison judgments between pairs are not consistent, some methods must be used to improve the matrix consistency and, therefore, to obtain coherent results. In this paper a model based on the Multi-Layer Perceptron (MLP) neural network is presented. Given an AHP pairwise matrix, this model is capable of completing missing values and improving the matrix consistency at the same time.     

A parametric GP model dealing with incomplete information for group decision-making

We consider a group decision-making problem where preferences given by the experts are articulated into the form of pairwise comparison matrices. In many cases, experts are not able to efficiently provide their preferences on some aspects of the problem because of a large number of alternatives, limited expertise related to some problem domain, unavailable data, etc., resulting in incomplete pairwise comparison matrices. Our goal is to develop a computational method to retrieve a group priority vector of the considered alternatives dealing with incomplete information. For that purpose, we have established an optimization problem in which a similarity function and a parametric compromise function are defined. Associated to this problem, a logarithmic goal programming formulation is considered to provide an effective procedure to compute the solution. Moreover, the parameters involved in the method have a clear meaning in the context of group problems.     

Interval estimation of priorities in the AHP

This paper extends and modifies the Analytic Hierarchy Process (AHP) and the Synthetic Hierarchy Method (SHM) of priority estimation to accommodate random data in the pairwise comparison matrices. It employs a Cauchy distribution to describe the pairwise comparison of alternatives in Saaty matrices, and shows how to modify these matrices in order to handle random data. The use of random data yields Saaty matrices that are not reciprocally symmetrical. Several variants of the AHP are then modified (i) to accommodate reciprocally asymmetric matrices, and (ii) to allow each priority estimate to be expressed on an interval of possible values, rather than as a single discrete point. The merits of interval estimation are illustrated by an example.     

Strong reciprocity and strong consistency in pairwise comparison matrix with fuzzy elements

The decision making problem considered in this paper is to rank n alternatives from the best to the worst, using the information given by the decision maker in the form of an \(n\times n\) pairwise comparison matrix. Here, we deal with pairwise comparison matrices with fuzzy elements. Fuzzy elements of the pairwise comparison matrix are applied whenever the decision maker is not sure about the value of his/her evaluation of the relative importance of elements in question. We investigate pairwise comparison matrices with elements from abelian linearly ordered group (alo-group) over a real interval. The concept of reciprocity and consistency of pairwise comparison matrices with fuzzy elements have been already studied in the literature. Here, we define stronger concepts, namely the strong reciprocity and strong consistency of pairwise comparison matrices with fuzzy intervals as the matrix elements (PCF matrices), derive the necessary and sufficient conditions for strong reciprocity and strong consistency and investigate their properties as well as some consequences to the problem of ranking the alternatives.     

Choosing weights from alternative optimal solutions of dual multiplier models in DEA

In this paper we propose a two-step procedure to be used for the selection of the weights that we obtain from the multiplier model in a DEA efficiency analysis. It is well known that optimal solutions of the envelopment formulation for extreme efficient units are often highly degenerate and, consequently, have alternate optima for the weights. Different optimal weights may then be obtained depending, for instance, on the software used. The idea behind the procedure we present is to explore the set of alternate optima in order to help make a choice of optimal weights. The selection of weights for a given extreme efficient point is connected with the dimension of the efficient facets of the frontier. Our approach makes it possible to select the weights associated with the facets of higher dimension that this unit generates and, in particular, it selects those weights associated with a full dimensional efficient facet (FDEF) if any. In this sense the weights provided by our procedure will have the maximum support from the production possibility set. We also look for weights that maximize the relative value of the inputs and outputs included in the efficiency analysis in a sense to be described in this article.     

An action learning approach for assessing the consistency of pairwise comparison data

Pairwise comparison data are used in various contexts including the generation of weight vectors for multiple criteria decision making problems. If this data is not sufficiently consistent, then the resulting weight vector cannot be considered to be a reliable reflection of the evaluator’s opinion. Hence, it is necessary to measure its level of inconsistency. Different approaches have been proposed to measuring the level of inconsistency, but they are often based on ‘rules of thumb” and/or randomly generated matrices, and are not interpretable. In this paper we present an action learning approach for assessing the consistency of the input pairwise comparison data that offer interpretable consistency measures.     

Deriving crisp and consistent priorities for fuzzy AHP-based multicriteria systems using non-linear constrained optimization

Fuzzy optimization models are used to derive crisp weights (priority vectors) for the fuzzy analytic hierarchy process (AHP) based multicriteria decision making systems. These optimization models deal with the imprecise judgements of decision makers by formulating the optimization problem as the system of constrained non linear equations. Firstly, a Genetic Algorithm based heuristic solution for this optimization problem is implemented in this paper. It has been found that the crisp weights derived from this solution for fuzzy-AHP system, sometimes lead to less consistent or inconsistent solutions. To deal with this problem, we have proposed a consistency based constraint for the optimization models. A decision maker can set the consistency threshold value and if the solution exists for that threshold value then crisp weights can be derived, otherwise it can be concluded that the fuzzy comparison matrix for AHP is not consistent for the given threshold. Three examples are considered to demonstrate the effectiveness of the proposed method. Results with the proposed constraint based fuzzy optimization model are more consistent than the existing optimization models.     

A method for approximating pairwise comparison matrices by consistent matrices

In several methods of multiattribute decision making, pairwise comparison matrices are applied to derive implicit weights for a given set of decision alternatives. A class of the approaches is based on the approximation of the pairwise comparison matrix by a consistent matrix. In the paper this approximation problem is considered in the least-squares sense. In general, the problem is nonconvex and difficult to solve, since it may have several local optima. In the paper the classic logarithmic transformation is applied and the problem is transcribed into the form of a separable programming problem based on a univariate function with special properties. We give sufficient conditions of the convexity of the objective function over the feasible set. If such a sufficient condition holds, the global optimum of the original problem can be obtained by local search, as well. For the general case, we propose a branch-and-bound method. Computational experiments are also presented.     

On relations between DEA-risk models and stochastic dominance efficiency tests

In this paper, several concepts of portfolio efficiency testing are compared, based either on data envelopment analysis (DEA) or the second-order stochastic dominance (SSD) relation: constant return to scale DEA models, variable return to scale (VRS) DEA models, diversification-consistent DEA models, pairwise SSD efficiency tests, convex SSD efficiency tests and full SSD portfolio efficiency tests. Especially, the equivalence between VRS DEA model with binary weights and the SSD pairwise efficiency test is proved. DEA models equivalent to convex SSD efficiency tests and full SSD portfolio efficiency tests are also formulated. In the empirical application, the efficiency testing of 48 US representative industry portfolios using all considered DEA models and SSD tests is presented. The obtained efficiency sets are compared. A special attention is paid to the case of small number of the inputs and outputs. It is empirically shown that DEA models equivalent either to the convex SSD test or to the SSD portfolio efficiency test work well even with quite small number of inputs and outputs. However, the reduced VRS DEA model with binary weights is not able to identify all the pairwise SSD efficient portfolios.     

Further Discussions on Induced Bias Matrix Model for the Pair-Wise Comparison Matrix

The inconsistency issue of pairwise comparison matrices has been an important subject in the study of the analytical network process. Most inconsistent elements can efficiently be identified by inducing a bias matrix only based on the original matrix. This paper further discusses the induced bias matrix and integrates all related theorems and corollaries into the induced bias matrix model. The theorem of inconsistency identification is proved mathematically using the maximum eigenvalue method and the contradiction method. In addition, a fast inconsistency identification method for one pair of inconsistent elements is proposed and proved mathematically. Two examples are used to illustrate the proposed fast identification method. The results show that the proposed new method is easier and faster than the existing method for the special case with only one pair of inconsistent elements in the original comparison matrix.