Table of Contents Author Guidelines Submit a Manuscript
Journal of Optimization
Volume 2015, Article ID 594727, 10 pages
http://dx.doi.org/10.1155/2015/594727
Research Article

Ranking All DEA-Efficient DMUs Based on Cross Efficiency and Analytic Hierarchy Process Methods

Department of Mathematics, Islamic Azad University, Arak Branch, Arak, Iran

Received 15 August 2014; Accepted 20 December 2014

Academic Editor: Farhad Hosseinzadeh Lotfi

Copyright © 2015 Dariush Akbarian. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

The aim of this paper is to present an original approach for ranking of DEA-efficient DMUs based on the cross efficiency and analytic hierarchy process (AHP) methods. The approach includes two basic stages. In the first stage using DEA models the cross efficiency value of each DEA-efficiency DMU is specified. In the second stage, the pairwise comparison matrix generated in the first stage is utilized to rank scale of the units via the one-step process of AHP. The advantage of this proposed method is its capability of ranking extreme and nonextreme DEA-efficient DMUs. The numerical examples are presented in this paper and we compare our approach with some other approaches.

1. Introduction

Data envelopment analysis (DEA) is a tool for evaluation and measuring of the efficiency of a set of decision making units (DMUs) that consume multiple inputs and produce multiple outputs, first introduced by Charnes, Cooper, and Rhodes (CCR) [1] and extended by Banker, Charnes, and Cooper (BCC) [2]. DEA is used to establish a best practice group from among a set of observed units and to identify the units that are inefficient when compared to the best practice group [36]. One important issue in DEA which has been studied by many DEA researchers is to discriminate between efficient DMUs. Several authors have proposed methods for ranking the best performers ([714] among others). Perhaps the most widely known and applied ranking method is the super-efficiency DEA model. Developed by Andersen and Petersen [13], the main idea of this approach is to evaluate DMU after this performer itself is excluded from the reference set. The problem with super-efficiency DEA is that under certain conditions infeasibility occurs which limits the applicability of the technique (for details see [15]). Wu [4] utilized the concept of fuzzy for ranking of DMUs in the traditional DEA models. For this purpose, firstly the DMUs are evaluated by the CCR and the cross efficiency models. Secondly, a fuzzy preference relation is established. Finally, a priority vector of the preference is constructed and is used for ranking DMUs. Jahanshahloo et al. [8] proposed a ranking system based on changing reference set. In the proposed ranking system, the evaluation for efficient DMUs is dependent on the efficiency changes of all inefficient units due to its absence in the reference set while the estimate for inefficient DMUs depends on the influence of the exclusion of each efficient unit from the reference set. One popular method to rank multiple alternatives with respect to multiple criteria is analytical hierarchy process (AHP) method developed by Saaty [16]. The analytic hierarchy process is a multicriteria decision making technique and was used for complete ranking of DMUs by Sinuany-Stern et al. [17] and Jablonsky [18, 19] and references cited therein. Sinuany-Stern et al. [17] presented an AHP/DEA methodology for ranking DMUs, which integrates DEA and the AHP. In this AHP/DEA methodology, DEA was first run for each pair of DMUs separately to create a pairwise comparison matrix, which was then solved using the eigenvector method to produce a full ranking for all DMUs, efficient and inefficient. Their method has some problems, such as illogic comparing of two DMUs in a DEA model (see [20] for details). Alirezaee and Sani [20] extended Sinuany-Stern’s approach and proposed a new two-stage AHP/DEA methodology for ranking DMUs that removes these problems. They used together with the efficiency of units the influence rate of each unit to the other units in order to determine the elements of pairwise comparison matrix. Jablonsky [18] used an AHP model with interval pairwise comparisons for the evaluation and classification of efficient units and compares the results with super-efficiency DEA scores. In [19], Jablonsky presented an original procedure for ranking of DMUs in DEA models based on combination of AHP and DEA principles. He/she considered the DMUs as alternatives and the ratios of output/input as criteria. An extensive review of ranking models in DEA is given in Adler et al. [12]. The aim of this paper is to propose a method for ranking extreme and nonextreme efficient DMUs using cross efficiency and AHP methods. Our approach includes two stages. In the first step using DEA models the cross efficiency value of each DEA-efficiency DMU is specified. In the second stage, the pairwise comparison matrix generated in the first step is utilized to rank scale of the units via the AHP. This paper is organized as follows. Section 2 presents some basic DEA models and reviews some ranking method. In Section 3 we briefly review the AHP. Section 4 gives a brief introduction to the cross efficiency evaluation. The new ranking method for DEA-efficient DMUs is developed in Section 5. Numerical examples are examined in Section 6. The paper is concluded in Section 7.

2. Data Envelopment Analysis Models

Consider a set of DMUs which is associated with inputs and outputs. Particularly, () consumes amount of input and produces amount of output . Let in which and and in which and . The production possibility set (PPS) of CCR model is defined as follows: and similarly the production possibility set of BCC model is defined as follows:

The input-oriented BCC and input-oriented CCR models, corresponding to , , are given by (3) and (4), respectively: where is non-Archimedean small and positive number and , , , and , , , are called slack variables belonging to . Note that and represent input excesses; also and represent output shortfalls. Also and , , are real numbers and . Models (3) and (4) are called envelopment forms (with non-Archimedean number).

is said to be strong efficient (CCR-efficient) if and only if and and . Where the superscript indicates optimality. In similar manner the BCC-efficient DMUs can be defined.

The dual of model (4) (without , i.e., ), which is called multiplier form (corresponding to ), is as follows:

The AP model is as follows [13]: Jahanshahloo’s method corresponding inefficient is as follows [8]: The efficiency of strong efficiency will be denoted by and will be given by in which is the set of nonstrong efficiency DMUs and is the number of nonstrong efficiency DMUs.

Jahanshahloo et al. [21] used -norm in order to rank the extremely efficient DMUs in DEA models with constant and variable returns to scale, and the proposed method can remove the difficulties arising from AP and MAJ [11] models. Their proposed model is as follows: As mentioned earlier, Sinuany-Stern’s approach [17] is a two-stage model for fully ranking model. In the first stage Sinuany-Stern run the following CCR model for each pair of DMUs and : is the efficiency score of unit . The cross efficiency of DMU is as follows: in which and are the optimal weights of model (10). In the similar manner and can be computed. The pairwise comparison matrix () is constructed as follows: In the second stage using a one-step process (Step 3 in Section 3), the vector weights of the pairwise comparison matrix are computed. Based on these weights, the efficient and inefficient DMUs are ranked.

Alirezaee and Sani [20] proposed a two-stage AHP/DEA methodology for ranking DMUs. In the first stage they create the pairwise comparison matrix as follows.

First, using CCR model (4) the relative efficiency of each DMU is determined. Then, each DMU is evaluated by the following model: This model measures efficiency after excluding from PPS. The pairwise comparison matrix is constructed as follows: in which and are the objective function of (4) and (13) at optimality, respectively.

In the second stage, similar to AHP/DEA method, using a one-step process of AHP, the DMUs are ranked. In this paper we rank DMUs in the CCR model; in a similar way one can also rank DMUs in the BCC model.

3. Analytical Hierarchy Process (AHP)

AHP is a powerful tool for analysis of complex decision problems. AHP is employed for ranking a set of alternatives or for the selection of the best in a set of alternatives with respect to multiple criteria. In this section a brief discussion of AHP is provided. For more details see Saaty [16].

Application of AHP to a decision problem involves four steps [23, 24].

Step 1 (structuring of the decision problem into a hierarchical model). The first step is to decompose a decision problem into elements. In its simplest form (Figure 1), this structure comprises a goal at the topmost level, criteria (and subcriteria) at the intermediate levels, while the lowest level contains a set of the alternatives. A simple AHP model (Figure 1) has three levels (goal, criteria, and alternatives).

Figure 1: Three-level hierarchy.

Step 2 (making pairwise comparisons and obtaining the judgment matrix). In this step, the elements of a particular level are compared with respect to a specific element in the immediate upper level. The more important (or more attractive) element receives higher rating (between 1 and 9) than another one that has the less important element [16]. The comparisons are used to form a matrix of pairwise comparisons called the judgment (pairwise comparison) matrix . Each entry of the judgment matrix satisfied the three rules: ; ; and for all , . In fact, the number shows the relative importance of alternative in comparison with alternative with respect to criterion or the relative importance of criteria in comparison with criterion with respect to goal. If , for all the entries of the matrix, then the matrix is said to be consistent. If the property does not hold for all the entries, the level of inconsistency can be captured by a measure called consistency ratio [16] (see next step).

Step 3 (local weights and consistency of comparisons). In this step, local weights of the elements are calculated from the judgment matrices using the eigenvector method (EVM). The normalized eigenvector corresponding to the principal eigenvalue of the judgment matrix provides the weights of the corresponding elements. Though EVM is followed widely in traditional AHP computations, other methods are also suggested for calculating weights, including the logarithmic least-square technique (LLST) [25, 26], goal programming [27], and recently DEAHP method [15, 16, 20, 22, 2433]. When EVM is used, consistency ratio (CR) can be computed. The consistency index (CI) is calculated as follows: in which is the number of criteria and is the maximum eigenvalue of the judgment matrix. Then, the consistency ratio (CR) is calculated as the ratio of consistency index and random index (RI); that is, Random index is the consistency index of a randomly generated reciprocal matrix from the scales 1 to 9. Table 1 shows the value of RI sorted by the order of matrix. For a consistent matrix and . A value of CR less than 0.1 is considered acceptable because human judgments need not be always consistent, and there may be inconsistencies introduced because of the nature of scale used. In the inconsistency case, . If CR for a matrix is more than 0.1, judgments should be elicited once again from the DM till he∖she gives more consistent judgments.

Table 1: Random index.

Remark 1. If the pairwise comparisons matrix is as follows: then any weight derivation method, when applied to the above matrix , should generate the true weights .

Step 4 (aggregation of weights across various levels to obtain the final weights of alternatives). In order to obtain final weights of the decision alternatives (elements at the lowest level), the local weights of elements of different levels are aggregated. For example, the final weight of alternative is computed using the following hierarchical (arithmetic) aggregation rule in traditional AHP: By definition, the weights of alternatives and importance of criteria are normalized. The final weights represent the rating of the alternatives in achieving the goal of the problem.

4. Cross Efficiency Evaluation

The cross efficiency evaluation was first proposed by Sexton et al. [30] and was later investigated by Doyle and Green [34, 35]. It is often calculated as a two-stage process. In the first stage, the optimal weights of inputs and outputs are calculated for each DMU using the classical DEA formulation, for example, CCR model (5). Let and be the optimal solution to the LP (5). Then, is referred to as the optimistic efficiency or CCR efficiency of , which reflects the self-evaluation of , whereas is referred to as a cross efficiency value of , which reflects the peer-evaluation of to ; . Consider Therefore, each DMU will have multiple different efficiency scores, whose average reflects the overall performance of the DMU. Based on average cross efficiencies, DMUs can be compared and ranked.

In general, the optimal weights obtained using classical DEA in the first stage are multiple solutions. Therefore, the values will change depending on these values in the second stage. In the second stage, these drawbacks are reduced and a suitable set of weights preserving the efficiency values obtained by DEA is selected for each DMU. To reduce this undesirable case, there are some model suggestions for preserving the self-efficiency scores, , obtained for each DMU. Sexton et al. [30] suggested introducing a secondary goal to optimize the input and output weights while keeping the CCR efficiency unchanged. According to Sexton et al. [30], the secondary goals could be, for example, either aggressive or benevolent. In the aggressive context, chooses the optimal solutions such that it maximizes self-efficiency and at a secondary level minimizes the other DMUs cross efficiency levels. The benevolent secondary objective would be to maximize all DMUs cross efficiency rankings. The most widely used secondary goals were suggested by Doyle and Green [34]. Wang and Chin [31] propose several new data envelopment analysis (DEA) models for cross efficiency evaluation by introducing a virtual ideal DMU (IDMU) and a virtual anti-ideal DMU (ADMU). These new DEA models determine the input and output weights by minimizing the distance of a DMU from IDMU or maximizing the distance between the DMU and ADMU or both of them simultaneously, without the use of the input and output information of the other DMUs as a secondary goal. Örkcü and Bal [33] presented goal programming models that could be used in the second stage of the cross evaluation. See also [31] for new alternative models for DEA cross efficiency evaluation. In this paper we present another secondary goal to the choice of weights among the alternative optimal solutions. For this aim, we first find the alternative optimal solutions corresponding to all extreme DEA-efficient DMUs using the algorithm proposed by Jahanshahloo et al. [36]. Then, the any nonnegative convex linear combination of these alternative optimal solutions can be considered as the chosen weights corresponding to (in this paper we consider the arithmetic mean of the alternative optimal solutions). The advantage of our approach is that in second stage it yields the positive weights (see Remark 2). We emphasize that one may choose another secondary goal to determine the input and output weights.

Remark 2. Any convex linear combination of optimal solutions of the following LP is optimal too: in which is the matrix and , , and are the and vectors, respectively.

5. Proposed Method

In this section we combine the cross efficiency method with AHP technique and provide a two-stage method for ranking all DEA-efficient DMUs using cross efficient approach and AHP technique. In the first stage, we obtain the CCR-efficient DMUs and the optimal solutions of the CCR model (5) corresponding to them. Note that model (5) may have the multiple solutions. In this case, we apply the proposed algorithm in [36] as secondary goal. Suppose are the optimal solutions (weights) of LP (5) corresponding to . The efficiency score of CCR-efficient using the weights of is as follows: Also, is referred to as a cross efficiency value of , which reflects the peer-evaluation of to (; ). Furthermore, if the input-output weights of the LP (5) are not unique, the arithmetic mean of the alternative optimal solutions corresponding to is considered as the optimal weights of in order to obtain positive weights (see Remark 2). In the second stage, using a one-step process of AHP (Step 3 in Section 3), the vector weights of the pairwise comparison matrix, generated in the first stage, are calculated. The DEA-efficient DMUs are ranked based on these weights. The pairwise comparison matrix is generated by as follows: Moreover, since the pairwise comparison matrices are constructed from objective data in our case, we are not concerned about the consistency of .

Remark 3. It is evident that , , .

It should be noted that since we intend to rank CCR-efficient DMUs, it is enough to compute the values of for each pair of CCR-efficient DMUs and . After determining the pairwise comparison matrix , AHP technique is applied for ranking CCR-efficient DMUs. In this paper we use the eigenvector method (EVM) for determining eigenvalue and eigenvector of the pairwise comparison matrix .

6. Numerical Examples

In this section, two numerical examples are examined to illustrate the proposed method. Comparisons with other existing procedures will also be made. In Example 2 we compare the proposed method with two other ranking methods which are based on AHP.

Example 1. We evaluated with our method the data of 20 branch banks of Iran. This data was previously analyzed by Amirteimoori and Kordrostami [22] and is listed in Table 2. Running the DEA model (4) will result in seven efficient units as 1, 4, 7, 12, 15, 17, and 20. Using the above-mentioned method the optimal weights corresponding to CCR-efficient , , are chosen. The results are summarized in Table 3. The cross efficiency and pairwise comparison matrices of seven CCR-efficient DMUs are shown in Tables 4 and 5, respectively. For this pairwise comparison matrix, , , and . So, pairwise comparison matrix is consistent enough. The corresponding eigenvector (weights) is shown in the last column of Table 5. Table 6 shows a comparison of our proposal and some other ranking approaches. All these approaches are implemented in input-oriented version under the condition of CRS. As reported in Table 6, is the most efficient one in our method. According to the results, the rankings of DMUs by the four methods are almost similar; in particular, the results of our method are more similar to the method [21].

Table 2: Example 1: DMUs’ data (extracted from [[22], p. 689]).
Table 3: Example 1: the optimal weights obtained by proposed method.
Table 4: Example 1: cross efficiency matrix for CCR-efficient DMUs.
Table 5: Example 1: pairwise comparison matrices of seven CCR-efficient DMUs.
Table 6: Example 1: results for comparing.

Example 2. Consider a performance assessment problem investigated by Sinuany-Stern et al. [17], which includes eight DMUs to be evaluated in light of two inputs and two outputs. The data set is provided in Table 7, together with the CCR-efficiencies of the eight DMUs, where the CCR efficiencies evaluate DMUs , , and to be all DEA efficient and they need to be further differentiated.
Table 8 shows the results obtained using the ranking methods of Alirezaee and Sani [20] and Sinuany-Stern et al. [17] and the proposed method. By our method DMU has the best performance. In contrast, DMU has the worst performance by Alirezaee’s method. In view of inputs and outputs of the efficient DMUs, it seems that our method gives more reasonable result than Alirezaee’s method.

Table 7: Example 2: DMUs’ data (extracted from [17]).
Table 8: Example 2: the results of ranking methods.

7. Conclusion

In this paper we propose a two-stage method for ranking all extreme and nonextreme efficient DMUs based on cross efficiency and AHP technique. In the first stage, cross efficiency score of each DEA-efficient DMU is calculated. In general, the optimal input-output weights obtained by classical DEA are not unique; therefore, the cross efficiency scores depending on these weights are also not unique. To remove this problem we first obtain all alternative optimal solutions of DEA model (5) and then the arithmetic mean of them is considered as a secondary goal. In the second stage, using a one-step process of AHP, the DEA-efficient DMUs are ranked. It seems that the proposed method gives more reasonable results, because we consider all alternative weights corresponding to DEA-efficient DMUs. Also, our method can be extended to interval cross efficiency and interval AHP. We suggest as future works a deeper analysis in this subject. Finally, in this paper we rank CCR-efficient DMUs; in a similar way one can also rank BCC-efficient DMUs.

Conflict of Interests

The author declares that there is no conflict of interests regarding the publication of this paper.

References

  1. A. Charnes, W. W. Cooper, and E. Rhodes, “Measuring the efficiency of decision making units,” European Journal of Operational Research, vol. 2, no. 6, pp. 429–444, 1978. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. R. D. Banker, A. Charnes, and W. W. Cooper, “Some mode ls for estimating technical and scale inefficiencies in data envelopment analysis,” Management Science, vol. 30, no. 9, pp. 1078–1092, 1984. View at Publisher · View at Google Scholar · View at Scopus
  3. D. D. Wu, “BiLevel programming data envelopment analysis with constrained resource,” European Journal of Operational Research, vol. 207, no. 2, pp. 856–864, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. D. D. Wu, “Performance evaluation: an integrated method using data envelopment analysis and fuzzy preference relations,” European Journal of Operational Research, vol. 194, no. 1, pp. 227–235, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. D. Wu and C.-G. Lee, “Stochastic DEA with ordinal data applied to a multi-attribute pricing problem,” European Journal of Operational Research, vol. 207, no. 3, pp. 1679–1688, 2010. View at Publisher · View at Google Scholar · View at Scopus
  6. D. Wu, O. Baron, and O. Berman, “Bargaining in competing supply chains with uncertainty,” European Journal of Operational Research, vol. 197, no. 2, pp. 548–556, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. J.-X. Chen and M. Deng, “A cross-dependence based ranking system for efficient and inefficient units in DEA,” Expert Systems with Applications, vol. 38, no. 8, pp. 9648–9655, 2011. View at Publisher · View at Google Scholar · View at Scopus
  8. G. R. Jahanshahloo, H. V. Junior, F. H. Lotfi, and D. Akbarian, “A new DEA ranking system based on changing the reference set,” European Journal of Operational Research, vol. 181, no. 1, pp. 331–337, 2007. View at Publisher · View at Google Scholar · View at Scopus
  9. S. Li, G. R. Jahanshahloo, and M. Khodabakhshi, “A super-efficiency model for ranking efficient units in data envelopment analysis,” Applied Mathematics and Computation, vol. 184, no. 2, pp. 638–648, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. F. H. Lotfi, A. A. Noora, G. R. Jahanshahloo, and M. Reshadi, “One DEA ranking method based on applying aggregate units,” Expert Systems with Applications, vol. 38, no. 10, pp. 13468–13471, 2011. View at Publisher · View at Google Scholar · View at Scopus
  11. S. Mehrabian, M. R. Alirezaee, and G. R. Jahanshahloo, “A complete efficiency ranking of decision making units in data envelopment analysis,” Computational Optimization and Applications, vol. 14, no. 2, pp. 261–266, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. N. Adler, L. Friedman, and Z. Sinuany-Stern, “Review of ranking methods in the data envelopment analysis context,” European Journal of Operational Research, vol. 140, no. 2, pp. 249–265, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. P. Andersen and N. C. Petersen, “A procedure for ranking efficient units in data envelopment analysis,” Management Science, vol. 39, no. 10, pp. 1261–1264, 1993. View at Publisher · View at Google Scholar
  14. Y.-M. Wang, Y. Luo, and L. Liang, “Ranking decision making units by imposing a minimum weight restriction in the data envelopment analysis,” Journal of Computational and Applied Mathematics, vol. 223, no. 1, pp. 469–484, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. L. M. Seiford and J. Zhu, “Infeasibility of super-efficiency data envelopment analysis models,” INFOR Journal, vol. 37, no. 2, pp. 174–187, 1999. View at Google Scholar
  16. T. L. Saaty, The Analytic Hierarchy Process: Planning, Priority Setting and Resource Allocation, McGraw-Hill, New York, NY, USA, 1980. View at MathSciNet
  17. Z. Sinuany-Stern, A. Mehrez, and Y. Hadad, “An AHP/DEA methodology for ranking decision making units,” International Transactions in Operational Research, vol. 7, no. 2, pp. 109–124, 2000. View at Publisher · View at Google Scholar · View at MathSciNet
  18. J. Jablonsky, “Using analytic hierarchy process as a tool for ranking of efficient units in dea models,” in Proceedings of the International Symposium on the Analytic Hierarchy Process, 2011.
  19. J. Jablonsky, “Measuring the efficiency of production units by AHP models,” Mathematical and Computer Modelling, vol. 46, no. 7-8, pp. 1091–1098, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. M.-R. Alirezaee and M. R. Sani, “New analytical hierarchical process/data envelopment analysis methodology for ranking decision-making units,” International Transactions in Operational Research, vol. 18, no. 5, pp. 533–544, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. G. R. Jahanshahloo, F. Hosseinzadeh Lotfi, N. Shoja, G. Tohidi, and S. Razavian, “Ranking using l1-norm in data envelopment analysis,” Applied Mathematics and Computation, vol. 153, no. 1, pp. 215–224, 2004. View at Google Scholar
  22. A. Amirteimoori and S. Kordrostami, “Efficient surfaces and an efficiency index in DEA: a constant returns to scale,” Applied Mathematics and Computation, vol. 163, no. 2, pp. 683–691, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. F. Zahedi, “The analytic hierarchy process-a survey of t he method and its applications,” Interfaces, vol. 16, no. 4, pp. 96–108, 1986. View at Publisher · View at Google Scholar
  24. R. Ramanathan, “Data envelopment analysis for weight derivation and aggregation in the analytic hierarchy process,” Computers & Operations Research, vol. 33, no. 5, pp. 1289–1307, 2006. View at Publisher · View at Google Scholar · View at Scopus
  25. G. Crawford and C. Williams, “A note on the analysis of subjective judgment matrices,” Journal of Mathematical Psychology, vol. 29, no. 4, pp. 387–405, 1985. View at Publisher · View at Google Scholar · View at Scopus
  26. F. A. Lootsma, Multi-Criteria Decision Analysis via Ratio and Difference Judgement, vol. 29 of Applied Optimization, Kluwer Academic, Dordrecht, The Netherlands, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  27. N. K. M. Bryson and A. Joseph, “Generating consensus priority point vectors: a logarithmic goal programming approach,” Computers and Operations Research, vol. 26, no. 6, pp. 637–643, 1999. View at Publisher · View at Google Scholar · View at Scopus
  28. Y.-M. Wang, C. Parkan, and Y. Luo, “A linear programming method for generating the most favorable weights from a pairwise comparison matrix,” Computers & Operations Research, vol. 35, no. 12, pp. 3918–3930, 2008. View at Publisher · View at Google Scholar · View at Scopus
  29. Y.-M. Wang, K.-S. Chin, and G. K. K. Poon, “A data envelopment analysis method with assurance region for weight generation in the analytic hierarchy process,” Decision Support Systems, vol. 45, no. 4, pp. 913–921, 2008. View at Publisher · View at Google Scholar · View at Scopus
  30. T. R. Sexton, R. H. Silkman, and A. J. Hogan, “Data envelopment analysis: critique and extensions,” in Measuring Efficiency: An Assessment of Data Envelopment Analysis, R. H. Silkman, Ed., pp. 73–105, Jossey-Bass, San Francisco, Calif, USA, 1986. View at Google Scholar
  31. Y.-M. Wang and K.-S. Chin, “Some alternative models for DEA cross-efficiency evaluation,” International Journal of Production Economics, vol. 128, no. 1, pp. 332–338, 2010. View at Publisher · View at Google Scholar · View at Scopus
  32. Y.-M. Wang, K.-S. Chin, and Y. Luo, “Cross-efficiency evaluation based on ideal and anti-ideal decision making units,” Expert Systems with Applications, vol. 38, no. 8, pp. 10312–10319, 2011. View at Publisher · View at Google Scholar · View at Scopus
  33. H. H. Örkcü and H. Bal, “Goal programming approaches for data envelopment analysis cross efficiency evaluation,” Applied Mathematics and Computation, vol. 218, no. 2, pp. 346–356, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  34. J. Doyle and R. Green, “Efficiency and cross-efficiency in DEA: derivations, meanings and uses,” Journal of the Operational Research Society, vol. 45, no. 5, pp. 567–578, 1994. View at Publisher · View at Google Scholar · View at Scopus
  35. J. R. Doyle and R. Green, “Cross-evaluation in DEA: improving discrimination among DMUs,” INFOR: Information Systems and Operational Research, vol. 33, no. 3, pp. 205–222, 1995. View at Google Scholar
  36. G. R. Jahanshahloo, F. Hosseinzadeh Lotfi, and D. Akbarian, “Finding weak defining hyperplanes of PPS of the BCC model,” Applied Mathematical Modelling, vol. 34, no. 11, pp. 3321–3332, 2010. View at Publisher · View at Google Scholar · View at Scopus