Research Article  Open Access
A. Barzegarinegad, G. Jahanshahloo, M. RostamyMalkhalifeh, "A Full Ranking for Decision Making Units Using Ideal and AntiIdeal Points in DEA", The Scientific World Journal, vol. 2014, Article ID 282939, 8 pages, 2014. https://doi.org/10.1155/2014/282939
A Full Ranking for Decision Making Units Using Ideal and AntiIdeal Points in DEA
Abstract
We propose a procedure for ranking decision making units in data envelopment analysis, based on ideal and antiideal points in the production possibility set. Moreover, a model has been introduced to compute the performance of a decision making unit for these two points through using common set of weights. One of the best privileges of this method is that we can make ranking for all decision making units by solving only three programs, and also solving these programs is not related to numbers of decision making units. One of the other advantages of this procedure is to rank all the extreme and nonextreme efficient decision making units. In other words, the suggested ranking method tends to seek a set of common weights for all units to make them fully ranked. Finally, it was applied for different sets holding real data, and then it can be compared with other procedures.
1. Introduction
Data envelopment analysis (DEA) is a nonparametric method to define the relative efficiency of a group of decision making units (DMUs) that use multiple inputs to produce multiple outputs. Methodology of DEA pioneered by Farrell [1] and later developed by Charnes et al. [2]. DEA computes the relative efficiencies of all DMUs by finding a set of the best weights for every DMU by maximizing its efficiency. On the other hand, flexibility in picking different inputs and outputs weights leads to coming up with DMUs as relative efficient which causes ranking disorders among DMUs. To reduce the flexibility in selecting inputs and outputs weights, researchers have already tried to modify the traditional DEA model and remove the weak points as well. Here are listed some of these offered methods. The assurance region model was firstly presented by Thompson et al. [3] and the common weights model by Roll et al. [4]. Roll and Golany [5] offered an alternative method in which they normalized all inputs and outputs at the beginning, in a way that the magnitude of parameters would not influence the model and then through imposing restrictions on the weights of the model, they could achieve common weights. Mavi et al. [6] presented a common set of weights using ideal point method. Hosseinzadeh Lotfi et al. [7] and Jahanshahloo et al. [8] proposed two different models in DEA by using common weights. They suggested that instead of solving linear programming models, we can reach the efficiency of DMUs through solving only one nonlinear programming model. Through utilizing multiple objective programming (MOP) and common set of weights (CSW), Hosseinzadeh Lotfi et al. [7] introduced a model to compute the efficiency of DMUs.
When DEA models are applied to calculate the performance of DMUs, usually several DMUs yield with the same efficiencies, that are all equal to one. Therefore, it is necessary to suggest a model to differentiate between these units. Otherwise, we are not able to rank them accordingly. Numerous models have been proposed to reduce the number of efficient units so far: Andersen and Petersen (AP) [9] and Mehrabian, Alirezaee, and Jahanshahloo (MAJ) [10] can be considered as two of the most popular of these methods; however, sometimes they fail in ranking. So we intend to compare the proposed procedure with the two aforementioned methods by some examples in this paper. Additionally, some papers based on crossefficiency have been prepared such as Sexton et al. [11], Wu et al. [12], Jahanshahloo et al. [13, 14], and Wang et al. [15].
One of the most important and practical procedures in ranking is benchmarking methods, which are suggested by Torgesen et al. [16], Sueyoshi [17], Lu and Lo [18], and Chen and Deng [19]. Wang et al. [20] presented two nonlinear programming models for full ranking which have high complexity for computations. You can see [21] for further study on ranking methods. To overcome the problems in the complete ranking of units, we propose a mixed integer programming which is capable of ranking every (extreme and nonextreme) efficient DMU, although sometimes other methods fail. The main purpose in this paper is introducing a model to evaluate the DEA efficiency of DMUs. We tend to suggest ideal and antiideal points in the model; then through using CSW and MOP a comprehensive evaluation of DMUs can be proposed. In addition, we prove that our model is feasible. The rest of this paper is organized as follows. Section 2 briefly introduces the approach of finding a CSW by MOP concepts. In Section 3, a procedure would be proposed to rank DMUs. Section 4 compares the proposed method with the other models using three numerical examples. The paper is concluded in the final section.
2. Common Set of Weights Model
Assume that there is a set of DMUs. Each () consumes the amounts of different of inputs () and produces the amounts of outputs (). Charnes et al. [2] presented following wellknown CCR model which measures the relative efficiencies of DMUs: where represents the under evaluation; and are the weights assigned to the outputs and inputs and presents a nonArchimedean infinitesimal. If there is a set of positive weights that makes , then is called relative efficient and otherwise it is called relative inefficient. The linear programming equivalent of model (1) is This problem has a dual which is given by The constraint space of (3) defines the production possibility set (PPS) . That is, It should be noted that is extreme efficient if and only if the model (3) has a unique optimal solution as follows:
Extra flexibility to choose weights mostly brings several DMUs with relative efficient DMUs. However, to remove this problem, many attempts have been explored further restricting weights in DEA. One of the most important ones is the common weights method in DEA, which at first initiated by Cook et al. [22]. The other method was proposed by Roll et al. [4] in DEA, where all DMUs can be evaluated by only one common weight. While it is almost tough, it can suggest more precise ranking; therefore each introduced efficient DMU of this method would be efficient DMU in primary DEA models. Hosseinzadeh Lotfi et al. [7] suggested a model to compute the efficiency of DMUs, in which they were only solved by one nonlinear programming model instead of linear programming models. The following multiobjective fractional programming (MOFP) can be used to maximize the efficiency score of all DMUs together [7]:
Several methods have been proposed to solve the aforementioned MOFP problem. One of them is goal programming (GP). Based on the GP method, model (6) can be transformed to the following model for attaining a set of common weights [23]: Here is the goal of the th objective function and , represent the positive deviation and negative deviation of the th goal, respectively. On the other hand, while in the conventional DEA models, every individual DMU tends to maximize its efficiency, so the amounts of in model (7) would be one.
3. The Proposed Ranking Method
On the first step we are going to introduce ideal and antiideal points.
Definition 1. An ideal point is a point that can consume the least inputs to produce the most outputs.
Definition 2. An antiideal point is a point that uses the most inputs only to generate the least outputs.
Due to mentioned definitions we can show the inputs and outputs of ideal point with and , respectively. Also, we denote by and the inputs and outputs of antiideal point, respectively. These are determined as follows: According to efficiency concept, the efficiency of ideal point can be defined as where , are the weights assigned to the th output and the th input, respectively. Suppose that is the ideal point efficiency, which results from the following LP model: As such, the efficiency score of antiideal point can be specified as If we consider as the efficiency of the antiideal point, then it can be solved by the model below:
Here we assume that is a goal for all DMUs, in such a way every single DMU tends to get its efficiency approach to it and consequently each DMU inclines toward getting its efficiency farther from . Then in accordance with this idea and goal programming,we obtain the following model: where and are deviation variables for the . Although model (13) is able to reduce the efficient units in DEA, it is still possible to evaluate more than one DMU as an efficient unit in DEA; therefore it cannot suggest a comprehensive ranking for DMUs. To overcome this problem, the following model is offered: where is a giant number. In model (14) each DMU by minimizing its efficiency from ideal point efficiency and maximizing from antiideal point efficiency tends to attain a set of inputs and outputs weights.
Definition 3. If is an optimal solution of model (2), then is a supporting hyperplane of the PPS.
Theorem 4. Model (14) is feasible and bounded.
Proof. For evaluating DMUs, we can use model (2). We know that there exists at least one extreme efficient unit by using model (2). Without loss of generality, suppose that the is extreme efficient. On the other hand, there exist an infinite number of supporting hyperplanes passing through any extreme efficient DMU [24]. We will show that there exists a supporting hyperplane that only lies on its intersection and . Since is extreme efficient, hence model (3) has a unique optimal solution
After including slack variables in the first constraints of model (2), according to strong complementary slackness conditions (SCSC) [25], there exist a pair of an optimal solution of model (2) and an optimal solution of model (3), such that
where . Therefore, since (16) is the unique optimal solution model (3); then by (17) we have
Equation (18) implies that
That is,
Hence, only lies on the supporting hyperplane . It is evident that (21) is a feasible solution for model (14):
On the other hand, since and , obviously model (14) is bounded. This completes the proof.
Let and be the optimal weights in model (14). Then is referred to as the efficiency of . Model (14) introduces a complete ranking for DMUs and this will be tested and illustrated in the next section through some examples.
4. Numerical Examples
In this section, we provide three numerical examples that all involve a significant number of DEA efficient units. Then we compare them to other methods to show the potential usage of the proposed ranking methodology in the complete ranking of DMUs.
Example 1. Consider the 12 flexible manufacturing systems (FMSs) given in Table 1 with two inputs and four outputs. These data are taken from Shang and Sueyoshi [26]. We solve proposed model for all FMSs and compare results with the Wang et al. [20] and Kao and Hung models [27]. Seeing the results in Table 1, the researcher can realize seven FMSs as CCR efficient FMSs. Therefore, it is impossible to have complete ranking for all FMSs. In order to solve this problem, Kao and Hung [27] suggested to use three common weights of DEA models. The gained results are shown in columns 2, 3, and 4 in Table 2. It is easily understood that in the first model of Kao and Hung [27], four FMSs and other models just generate two FMSs as efficient FMSs. Moreover, these three models illustrate three different ranking, which is a demerit of the proposed models by Kao and Hung [27].
However, the main deficiency in Kao and Hung [27] is that the proposed models related to as a parameter which is calculated in Example 1 as , , and . Wang et al. [20] suggested two models utilizing common weights which to some extent eliminate deficiencies of the Kao and Hung models. As it can be seen in Table 2, Wang et al. [20] evaluate as the efficient FMS. The resulted efficiencies and rankings by Wang models are inserted in the fifth and sixth columns of Table 2. Although the two proposed models by Wang et al. [20] have the same ranking, this is not right always. On the other hand, the introduced models are nonlinear ones. Although their method is an interesting approach as a theoretical idea, it could not be efficient from computational point of view. The last column in Table 2 illuminates the results of efficiency and ranking obtained by the proposed model of the paper. It is clear from Table 2 that the proposed model with ideal and antiideal points considers as the efficient FMS, and all the other 11 FMSs as nonefficient. As you may notice from Table 2, has the worst performance by Wang et al. and suggested models.


Example 2. Consider the example investigated by Jahanshahloo et al. [28] where all DMUs have two inputs and two outputs. The data are reproduced in Table 3, together with the CCR efficiencies of seven DMUs. The example is solved by two methods: AP and MAJ which are the most popular methods. In accordance with Table 3, the results of ranking by proposed method are almost the same with AP and MAJ ranking methods. On the other hand, we can achieve correlation analysis of the efficiencies gained by imposing these three models. Table 4 states results of analysis. This research has been significant at the level of 0.01. As you can see in Table 4, there is a high correlation between the proposed model and AP and MAJ models. It is worth notifying that if AP and MAJ models are infeasible or unable to present a complete ranking, these three models lack this correlation and ranking declines to its lowest level of correlation analysis. So, please notice the next example.

 
Correlation is significant at the 0.01 level (twotailed). 
Example 3. Consider the problem of measuring the performances of five DMUs, where each DMU has two inputs and one output. The data set is shown in Table 5. Here all outputs have been normalized to one for convenience. The Farrell frontier for these DMUs is shown in Figure 1. As can be seen in Figure 1, DMU_{A}, DMU_{D}, and DMU_{E} are extreme efficient DMUs and DMU_{B} and DMU_{C} are nonextreme efficient DMUs. The results of this example by using our proposed method, and , are documented in Table 5. As you can see in Table 5, AP and MAJ models could not rank and ; however the proposed model here is able to rank both extreme and nonextreme efficient DMUs. It shows the first privilege of the new ranking model over AP and MAJ models. According to the suggested model, performance of the five DMUs is ranked as follows: where “” denotes superior to. The second advantage of the proposed method is that to obtain a complete ranking for all DMUs; the researcher just needs to solve three programs, though the other models lack this merit. The third privilege is its feasibility; however, in some cases the AP and MAJ models are infeasible. Utilizing correlation analysis at the 0.01 level, then correlation between the suggested method and AP, MAJ is recorded as 0.478 and 0.185, respectively. This poor correlation is for this fact that AP and MAJ are not able to present a comprehensive ranking.

5. Conclusion
In the current paper, we have developed a new mixed integer programming based on ideal and antiideal points. In this procedure, firstly we must compute ideal and antiideal points to rank all DMUs. Then their efficiency scores could be obtained. Through using the proposed model, all DMUs can be ranked, whereas most of ranking methods cannot do it. One of the prominent features of this model compared to the others is that it is always feasible. On the other hand, traditional DEA models cannot define a DMU with the best performance. However, it can be easily conducted by the proposed model here. The other advantage of this new model is that we are able to rank all the extreme and nonextreme efficient units by solving only three programs. Three numerical examples have been tested and examined by applying the suggested ranking method. The proposed model complies with crisp data. It can be examined further in the future researches in accordance with interval or fuzzy data.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgement
The authors would like to express their thanks to Professor Farhad Hosseinzadeh Lotfi for his help in initiating and developing the basic idea of this article. We are grateful to the anonymous referees for their valuable comments.
References
 M. Farrell, “The measurement of productive efficiency,” Journal of the Royal Statistical Society A, vol. 120, pp. 253–281, 1957. View at: Google Scholar
 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 Site  Google Scholar  Zentralblatt MATH  MathSciNet
 R. G. Thompson, L. N. Langemeier, C. Lee, E. Lee, and R. M. Thrall, “The role of multiplier bounds in efficiency analysis with application to Kansas farming,” Journal of Econometrics, vol. 46, no. 12, pp. 93–108, 1990. View at: Publisher Site  Google Scholar
 Y. Roll, W. D. Cook, and B. Golany, “Controlling factor weights in data envelopment analysis,” IIE Transactions, vol. 23, no. 1, pp. 2–9, 1991. View at: Google Scholar
 Y. Roll and B. Golany, “Alternate methods of treating factor weights in DEA,” Omega, vol. 21, no. 1, pp. 99–109, 1993. View at: Publisher Site  Google Scholar
 R. K. Mavi, S. Kazemi, and J. M. Jahangiri, “Developing common set of weights with considering nondiscretionary inputs and using ideal point method,” Journal of Applied Mathematics, vol. 2013, Article ID 906743, 9 pages, 2013. View at: Publisher Site  Google Scholar  MathSciNet
 F. Hosseinzadeh Lotfi, G. R. Jahanshahloo, and A. Memariani, “A method for finding common set of weights by multiple objective programming in data envelopment analysis,” Southwest Journal of Pure and Applied Mathematics, no. 1, pp. 44–54, 2000. View at: Google Scholar  Zentralblatt MATH  MathSciNet
 G. R. Jahanshahloo, F. Hosseinzadeh Lotfi, and M. Moradi, “A DBA approach for fair allocation of common revenue,” Applied Mathematics and Computation, vol. 160, no. 3, pp. 719–724, 2005. View at: Publisher Site  Google Scholar
 P. Andersen and N. C. Petersen, “A procedure for ranking efficient units in data envelopment analysis,” Management Science, vol. 39, pp. 1261–1264, 1993. View at: Google Scholar
 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 Site  Google Scholar  MathSciNet
 T. R. Sexton, R. H. Silkman, and A. J. Hogan, “Data envelopment analy sis: critique and extensions,” in Measuring Efficiency: An Assessment of Data Envelopment Analysis, H. R. Silkman, Ed., pp. 73–105, Jossey Bass, San Francisco, Calif, USA, 1986. View at: Google Scholar
 J. Wu, J. Sun, L. Liang, and Y. Zha, “Determination of weights for ultimate cross efficiency using Shannon entropy,” Expert Systems with Applications, vol. 38, no. 5, pp. 5162–5165, 2011. View at: Publisher Site  Google Scholar
 G. R. Jahanshahloo, M. Khodabakhshi, F. Hosseinzadeh Lotfi, and M. R. Moazami Goudarzi, “A crossefficiency model based on superefficiency for ranking units through the TOPSIS approach and its extension to the interval case,” Mathematical and Computer Modelling, vol. 53, no. 910, pp. 1946–1955, 2011. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 G. R. Jahanshahloo, F. H. Lotfi, Y. Jafari, and R. Maddahi, “Selecting symmetric weights as a secondary goal in {DEA} crossefficiency evaluation,” Applied Mathematical Modelling, vol. 35, no. 1, pp. 544–549, 2011. View at: Publisher Site  Google Scholar  MathSciNet
 Y.M. Wang, K.S. Chin, and Y. Luo, “Crossefficiency evaluation based on ideal and antiideal decision making units,” Expert Systems with Applications, vol. 38, no. 8, pp. 10312–10319, 2011. View at: Publisher Site  Google Scholar
 A. M. Torgersen, F. R. Førsund, and S. A. C. Kittelsen, “Slackadjusted efficiency measures and ranking of efficient units,” Journal of Productivity Analysis, vol. 7, no. 4, pp. 379–398, 1996. View at: Publisher Site  Google Scholar
 T. Sueyoshi, “DEA nonparametric ranking test and index measurement: slackadjusted DEA and an application to Japanese agriculture cooperatives,” Omega, vol. 27, no. 3, pp. 315–326, 1999. View at: Publisher Site  Google Scholar
 W. Lu and S. Lo, “An interactive benchmark model ranking performers: application to financial holding companies,” Mathematical and Computer Modelling, vol. 49, no. 12, pp. 172–179, 2009. View at: Publisher Site  Google Scholar  MathSciNet
 J. X. Chen and M. Deng, “A crossdependence 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 Site  Google Scholar
 Y. Wang, Y. Luo, and Y. Lan, “Common weights for fully ranking decision making units by regression analysis,” Expert Systems with Applications, vol. 38, no. 8, pp. 9122–9128, 2011. View at: Publisher Site  Google Scholar
 F. Hosseinzadeh Lotfi, G. R. Jahanshahloo, M. Khodabakhshi, M. RostamyMalkhlifeh, Z. Moghaddas, and M. VaezGhasemi, “A review of ranking models in data envelopment analysis,” Journal of Applied Mathematics, vol. 2013, Article ID 492421, 20 pages, 2013. View at: Publisher Site  Google Scholar
 W. D. Cook, Y. Roll, and A. Kazakov, “A DEA model for measuring the relative efficiency of highway maintenance patrols,” INFOR, vol. 28, no. 2, pp. 113–124, 1990. View at: Google Scholar
 A. Davoodi and H. Z. Rezai, “Common set of weights in data envelopment analysis: a linear programming problem,” Central European Journal of Operations Research, vol. 20, no. 2, pp. 355–365, 2012. View at: Publisher Site  Google Scholar  MathSciNet
 M. S. Bazaraa and C. M. Shetty, Nonlinear Programming Theory and Algorithms, John Wiley & Sons, New York, NY, USA, 1979. View at: MathSciNet
 M. Bazaraa and C. M. Shetty, Linear Programming and Network Flows, John Wiley & Sons, New York, NY, USA, 1990.
 J. Shang and T. Sueyoshi, “A unified framework for the selection of a fexible manufacturing system,” European Journal of Operational Research, vol. 85, no. 2, pp. 297–315, 1995. View at: Publisher Site  Google Scholar
 C. Kao and H.T. Hung, “Data envelopment analysis with common weights: the compromise solution approach,” Journal of the Operational Research Society, vol. 56, no. 10, pp. 1196–1203, 2005. View at: Publisher Site  Google Scholar
 G. R. Jahanshahloo, F. Hosseinzadeh Lotfi, V. Rezaie, and M. Khanmohammadi, “Ranking DMUs by ideal points with interval data in DEA,” Applied Mathematical Modelling, vol. 35, no. 1, pp. 218–229, 2011. View at: Publisher Site  Google Scholar  MathSciNet
Copyright
Copyright © 2014 A. Barzegarinegad et al. 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.