Calculating Super Efficiency of DMUs for Ranking Units in Data Envelopment Analysis Based on SBM Model

Abstract

There are a number of methods for ranking decision making units (DMUs), among which calculating super efficiency and then ranking the units based on the obtained amount of super efficiency are both valid and efficient. Since most of the proposed models do not provide the projection of Pareto efficiency, a model is developed and presented through this paper based on which in the projection of Pareto-efficient is obtained, in addition to calculating the amount of super efficiency. Moreover, the model is unit invariant, and is always feasible and makes the amount of inefficiency effective in ranking.

(ProQuest: ... denotes non-US-ASCII text omitted.)

E. Zanboori 1 and M. Rostamy-Malkhalifeh 1 and G. R. Jahanshahloo 1 and N. Shoja 2

Academic Editor:Mohsen Vaez-ghasemi

1, Department of Mathematics, Islamic Azad University, Science and Research Branch, Tehran, Iran
2, Department of Mathematics, Islamic Azad University, Firozkoh Branch, Firozkoh, Iran

Received 5 April 2014; Revised 18 July 2014; Accepted 20 July 2014; 19 August 2014

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.

1. Introduction

Since in the current world a wide variety of companies and organizations of different areas work in common ground under the supervision of a common manager (like central bank in a country or other banks and respective branches), in order to improve the performance of units, a manager in addition to evaluation should rank them and present an efficient pattern corresponding to inefficient units. Data envelopment analysis (DEA) is a technique for calculating the amount of efficiency in DMUs which have multiple inputs and outputs. According to the obtained efficiency through this technique, these units can be ranked and distinction can be made between efficient units and inefficient ones [1-4].

So far, a number of studies have been conducted for ranking DMUs and according to them various models have been proposed. Banker et al. in [5] using additive model evaluated DMUs and ranked them. Sexton's cross-efficiency method is another method of ranking presented in 1986 [6]. In this method, first, all DMUs are assessed by multiplier model and then optimal weights corresponding to each unit are considered for other units and the amount of objective function is measured. Afterwards, for each unit, the obtained amounts are combined through averaging and, by considering the achieved number, DMUs are ranked. The disadvantages of this method can be attributed to the presence of multiple optimal solutions as well as unreliability of averaging in unit rank. It is worth mentioning that many researchers such as [7-13] have proposed different models for improving sexton method. Andersen and Petersen in 1993 proposed a method in which they could rank extreme efficient units by eliminating unit under evaluation of production possibility set (PPS) and forming a new PPS [14]. In 1998, Mehrabian et al. using weight constraints on input and output weights in A.P. model solved some of its problems such as instability; however, others including the ranking of nonextreme efficient units, lack of presenting Pareto-efficient projection, and infeasibility in some cases still remained [15]. Li et al. (1999) modified Mehrabian et al.'s model and simultaneously by enhancing outputs and reducing inputs to the same extent resolved the mentioned infeasibility [16]. Sueyoshi (1999) adding weight constraints to CCR multiplier model developed an approach named benchmarking method. Their model like A.P. suffered infeasibility in some cases. Sueyoshi introduced AIN parameter for the purpose of ranking extreme efficient units [6]. Common weight is another method developed in 2000 by Hosseinzadeh Lotfi et al. for ranking units. That model through which units were evaluated and ranked was multiobjective; however, after specific transformation, a nonlinear programming model resulted [17]. In 2004, gradient line method was introduced by Jahanshahloo et al. for ranking extreme efficient units [18]. This method was always feasible despite the fact that it does not provide any suggestion for ranking the nonextreme efficient units. Jahanshahloo et al. presented other methods such as Mont Carlo, norms (_L1 and _L∞ ), Chebyshev norm, and concept of advantage, all of which rank the units in a way [4, 19-27]. In addition, there exist some other ranking methods not much developed and extended in the literature [4, 7, 18, 20, 21, 28-33].

Among the above-mentioned methods, A.P. is the one which has been mostly used despite its disadvantages like lack of finding Pareto-efficient projection, infeasible cases, lack of ranking nonextreme efficient units, and finally lack of stability corresponding to data transformation. A number of researchers have proposed various models and attempted to modify it and eliminate its problems [14, 16, 27, 34-45].

In this paper, besides ranking DMUs, a projection of Pareto-efficient is presented. Also, the amount of inefficiency has been involved in the ranking. The model is always feasible and stable corresponding to data transformation. In this paper, first SBM model and then Tone super efficiency are presented. Afterwards, the proposed model along with some theorems is introduced. Then, using 2 different numerical examples, the proposed model is compared with Tone model and the results are revealed.

2. Preliminaries

Suppose that there is a set of n DMUs {_DMUj : j=1,2,...,n} , producing s outputs _yrj (r=1,2,...,s) by consuming m inputs. Assume that all the vector of _xij (i=1,...,m) inputs and outputs are not negative and are opposed to zero. The production possibility set (PPS) spanned by all DMUs is defined as follows: [figure omitted; refer to PDF] Based upon the constant return to scale (CRS), the SBM model is described as follows. It assumed that _xij >0(i=1,...,m , j=1,2,...,n) and _yrj >0 (r=1,2,...,s , j=1,2,...,n) : [figure omitted; refer to PDF]

Definition 1.

_{DMU k} in model (2) is defined as an efficient unit if and only if ^ρ* =1 . In other words, _DMUk is SBM-efficient, whenever ^zi*- =0 , ^zi*+ =0 .

In order to define super efficiency model corresponding to model (2), to obtain new PPS without considering _DMUk , ^{Pc[variant prime]} is as the following: [figure omitted; refer to PDF] Tone introduced model (4) for calculating super efficiency of DMUs based on production possibility set ^{Pc[variant prime]} : [figure omitted; refer to PDF] If nonefficient units were evaluated through the above model, the efficient score for all of them would be equal to one. In other words, nonefficient units could not be distinguished. Therefore, both efficient and nonefficient units should be considered discretely and it firstly requires solving SBM model for all DMUs and then distinguishing efficient units from nonefficient ones and, finally, super efficiency score is obtained.

This paper through the coming sections seeks to present a model based on which super efficiency score for nonefficient units is measured and projection of Pareto-efficient for all units is obtained.

3. Proposed Model

In this section, a model is introduced which its notion is based on the minimum distance from nonradial view. In this model, using the fact that input vector (output vector) corresponding to each unit is not exactly equal to zero, the maximum amount of each component is obtained from input and output vectors. Then, considering these amounts and also PPS of ^{Pc[variant prime]} , all units are solved by model (5). In this model, the point from ^{Pc[variant prime]} frontier to the unit under evaluation is obtained as follows: [figure omitted; refer to PDF] The point (_xik +^ti-*ximax... ,_yrk - ^tr+*yrmax... ) is the point of ^{Pc[variant prime]} . Regarding the position of units in ^{Pc[variant prime]} and the obtained projection of the unit under evaluation by model (5), two cases are probable to happen. The first case is like _DMUf of Figure 1 in which the obtained projection is placed on the strong frontier while the second case is similar to _DMUe in Figure 2 in which its projection is on the weak frontier.

Figure 1: [figure omitted; refer to PDF]

Figure 2: [figure omitted; refer to PDF]

Since projection point may lie on weak frontier, for the purpose of finding Pareto-efficient projection point for all units under evaluation, model (6) should be solved. In this model, (^ti-*ximax... ,^tr+*yrmax... ) is the optimal solution of model (5): [figure omitted; refer to PDF] Through this, first by adding input saving (^ti-*ximax... ) and subtracting output surpluses (^tr+*yrmax... ) to and from the unit under evaluation, it moves to a point of ^{Pc[variant prime]} which is a frontier point. Moreover, since it may lie on the weak frontier, it is projected on Pareto-efficient point by using model (6).

In this way, if DMU is nonefficient, ^ti-* = ^tr+* =0 . Consequently, for its projection model (6) which is in fact the same as SBM model is used. Super efficiency score in this method for _DMUk is defined as follows: [figure omitted; refer to PDF] As it is observed in the above definition, if the first projection of the unit under evaluation like _DMUe lies on the weak frontier, the second projection which is Pareto-efficient is considered for this unit. Furthermore, the amount of slack variables (^si- ,^sr+ ) is included in the definition.

Theorem 2.

Model (4) and model (5) are equivalent.

Proof.

As can be seen in model (2), _x-i ...5;_xik , _y-r ...4;_yrk . Substitute _x-i =_xik +^ti-ximax... and _y-r =_yrk +^tr+yrmax... in model (4) and rewrite the following: [figure omitted; refer to PDF] The solution space of both model (6) and model (7) is equal. After rearrangement, simplifying the objective function of model (7), we will have the following: [figure omitted; refer to PDF] It can be seen that model (8) is the same as model (5).

Theorem 3.

If DM_Uk ∉^{Pc[variant prime]} , ^{[straight phi]*} ...4;^δ* .

Proof.

Since _DMUk ∉^{Pc[variant prime]} , there exists an i in model (5), in which ^ti-* >0 or there exists an r in which ^tr+* >0 . Thus (1+(1/m)^∑i=1m (^ti-*ximax... /_xik ))/(1-(1/s)^∑r=1s (^tr+*yrmax... /_yrk ))>1 . Depending on the position of projection point of DM_Uk on strong frontier or weak frontier, the amounts of ^si*- ,^sr*+ are greater than or equal to zero in the definition of ^{[straight phi]*} . Therefore, ^{[straight phi]*} =(1+(1/m)^∑i=1m ((^ti-*ximax... -^si*- )/_xik )) /(1-(1/s)^∑r=1s ((^tr+*yrmax... -^sr*+ )/_yrk ))...4;(1+(1/m)^∑i=1m (^ti-*ximax... /_xik ))/(1-(1/s)^∑r=1s (^tr+*yrmax... /_yrk ))=^δ* .

Theorem 4.

If DM_Uk belongs to ^{Pc[variant prime]} , ^{[straight phi]*} =^ρ* .

Proof.

Since _DMUk ∈^{Pc[variant prime]} , using model (5), ^ti-* =^tr+* =0 . Then, substituting them in model (6), model (2) is obtained and also ^si*- =^zi*- , ^sr*+ =^zr*+ . Therefore, by definition of super efficiency, (*) : ^{[straight phi]*} =(1-(1/m)^∑i=1m (^si*- /_xik ))/(1+(1/s)^∑r=1s (^sr*+ /_yrk )) =(1-(1/m)^∑i=1m (^zi*- /_xik )) /(1+(1/s)^∑r=1s (^zr*+ /_yrk )) = ^ρ* .

Theorem 5.

If DM_Uk is not efficient in model (2), that is, not SBM-efficient, the input excesses (^si- ) and output shortfalls (^si+ ) identified by model (6) are the same as the those identified by model (2); in other words, ^si*- =^zi*- ,^sr*+ =^zr*+ .

Proof.

If _DMUk is evaluated by model (4) and is not efficient, then _DMUk ∈^{Pc[variant prime]} and also ^ti-* =^tr+* =0 . As a result, model (6) is degenerated to model (2) and then ^si*- =^zi*- and ^sr*+ =^zr*+ .

Theorem 6.

According to the obtained amount of super efficiency ^{[straight phi]*} , three cases are identified as follows:

(a) If ^{[straight phi]*} >1 , ^{[straight phi]*} ...4;^δ* ;

(b) If ^{[straight phi]*} =1 , ^{[straight phi]*} =^δ* =^ρ* ;

(c) If ^{[straight phi]*} <1 , ^{[straight phi]*} =^ρ* .

Proof.

(a) Since ^{[straight phi]*} >1 , _DMUk does not belong to ^{Pc[variant prime]} . Thus, according to Theorem 3, ^{[straight phi]*} ...4;^δ* .

(b) If ^{[straight phi]*} =1 , _DMUk is placed on ^{Pc[variant prime]} frontier. This means that in model (5) the amount of ^ti-* ,^tr+* =0 . Therefore, ^δ* =(1+(1/m)^∑i=1m (^ti-*ximax... /_xik ))/(1-(1/s)^∑r=1s (^tr+*yrmax... /_yrk ))=1 . Moreover, ^{[straight phi]*} = (1-(1/m)^∑i=1m (^si*- /_xik )) /(1+(1/s)^∑r=1s (^sr*+ /_yrk ))=1 . Thus, considering the definition of ρ in model (2) and Theorem 3, ^{[straight phi]*} =^δ* =^ρ* .

(c) In the third case, in which ^{[straight phi]*} <1 , based on the mentioned definition of super efficiency, ^{[straight phi]*} =(1-(1/m)^∑i=1m (^si*- /_xik ))/(1+(1/s)^∑r=1s (^sr*+ /_yrk )) . Besides, according to model (5), ^ti-* = ^tr+* =0 . Consequently, ^δ* =(1+(1/m)^∑i=1m (^ti-*ximax... /_xik ))/(1-(1/s)^∑r=1s (^tr+*yrmax... /_yrk ))=1 . Using model (5), it is shown that ^{[straight phi]*} =^ρ* .

Theorem 7.

Model (5) is unit invariant.

Proof.

If in model (5) either all inputs or outputs are divided or multiplied by a number, the model is unit invariant and the optimal solution does not change because [figure omitted; refer to PDF] After simplifying K of objective function and constraints, model (9) degenerates to model (5).

Theorem 8.

The identified projection from model (6) is Pareto-efficient.

Proof.

2 cases are considered for _DMUk .

Case 1 . _DMUk belongs to spanned production possibility set by _DMUi (i...0;k) . In this case, model (6) degenerates to SBM model and the projection is Pareto-efficient.

Case 2 . If _DMUk does not belong to production possibility set, then (^ti-*ximax... ,^tr+*yrmax... ) is placed on frontier of PPS spanned by all _DMUs excluding _DMUk . It is claimed that the point (_xik +^ti-*ximax... -^si*- ,_yrk -^tr+*yrmax... +^sr*+ ) is Pareto-efficient.

Proof by contradiction: if the above-mentioned point is not Pareto-efficient, then there exists a point like (_xik +^ti-*ximax... -^s-i- ,_yrk -^tr+*yrmax... +^s-r+ ) which dominates (_xik +^ti-*ximax... -^si*- ,_yrk -^tr+*yrmax... +^sr*+ ) . This contradicts the optimal property of ^sr*+ ,^si*- .

Theorem 9.

Model (5) is always feasible.

Proof.

If _DMUk ∈^{Pc[variant prime]} , according to definition of ^{Pc[variant prime]} , [figure omitted; refer to PDF] Choosing (λ- , ^ti- =0 , ^tr+ =0) , a feasible solution of model (5) can be obtained. Otherwise, if _DMUk ∉^{Pc[variant prime]} , the corresponding solution for that should be found. For this purpose, at first, we should suppose that λ-=1 . The input constraints of model (5) are ^{∑j=1,j...0;kn}_xij -_xik ...4;^titximax... . Since ^ximax... >0 , ^yrmax... >0 , ∀i , r , ^t-i- is defined as follows: [figure omitted; refer to PDF] Moreover, corresponding to output constraints λ-=1 , ^yrmax... >0,∀r , ^t-r+ is defined as follows: [figure omitted; refer to PDF] Considering (λ-,^{t-i -} ,^t-r+ ) , a feasible solution for model (5) is achieved.

Model (6) is a fractional programming model that can be modified to a linear programming as follows. That occurs by substituting variable t which itself is defined by 1/t=1+(1/s)^∑i=1s (^sr+ /_yrk ) [figure omitted; refer to PDF] In model (13), it should be considered that t>0 . The optimal solution for model (13) is (^{λ^j*} ,^{s^i *-} ,^{s^r *+} ,^t* ) by which the optimal solution of model (6) is obtained as follows: [figure omitted; refer to PDF]

4. Numerical Examples

Two examples of Tone [26, 46] were revisited and ranked through evaluation of units by both our and Tone's methods. In the first example, it is supposed that the 5 decision making units have 2 inputs and 2 outputs. The related data and results are listed in Table 1. The first column represents units. In columns 2 and 3, information about inputs is presented; however, that of outputs is listed in columns 4 and 5. The sixth column (^ρ* ) shows the amount of optimal solution for model (2). Column seven (^δ* ) represents optimal solution for each unit in model (4). The eighth column indicates the amounts of super efficiency which is obtained through the proposed method. For calculating ^{[straight phi]*} , first, the units are evaluated by model (5) and then by substituting point (_xik +^ti-*ximax... ,_yrk - ^tr+*yrmax... ) in model (6) the optimal solution is obtained and considering the optimal amounts of (^ti-* ,^tr+* ),(^si-* ,^sr+* ) and substituting them in the proposed definition of super efficiency (*) , the amount of ^{[straight phi]*} is obtained. Finally, in column 9 the unit ranks are presented based on ^{[straight phi]*} .

Table 1

DMU	Inp. 1	Inp. 2	Out. 1	Out. 2	ρ *	δ *	[straight phi] *	Rank
1	4	3	2	3	0.7980	1	0.7980	3
2	6	3	2	3	0.5682	1	0.5682	5
3	8	1	6	2	1	1.3333	1.3333	1
4	8	1	6	1	0.6667	1	0.6667	4
5	2	4	1	4	1	1.4545	0.9919	2

As it is noticed in Table 2, despite the fact that the amount of ^{[straight phi]*} for unit 5 is bigger than that of unit 3, by calculating super efficiency through the proposed method, it is observed that the rank of unit 3 is better than that of unit 5.

Table 2

DMU	Inp. 1	Inp. 2	Inp. 3	Inp. 4	Out. 1	Out. 2	ρ *	δ *	[straight phi] *	Rank
1	80	600	54	8	90	5	1	1.0116	0.7798	4
2	65	200	97	1	58	1	1	1.4146	0.9164	2
3	83	400	72	4	60	7	1	1.0781	0.7677	5
4	40	1000	75	7	80	10	1	1.1563	0.7927	3
5	52	600	20	3	72	8	1	1.5858	1.8107	1
6	94	700	36	5	96	6	1	1.0198	0.7590	6

In the second example, 6 decision making units with 4 inputs and 2 outputs are considered. In this example, the units are evaluated by both proposed method and Tone's method and then ranked. Table 2 shows the data of those units. As it is noticed, ^ρ* =1 . This means that all units are SBM-efficient and are located on the frontier. DMU₅ in both methods has the first rank.

As it is seen, ranks of units in proposed method (^{[straight phi]*} ) were 4, 2, 5, 3, 1, and 6, respectively, while those of Tone's got 6, 2, 4, 3, 1, and 5, respectively.

5. Conclusion

In data envelopment analysis, a wide variety of models have been presented by using which decision making units can be evaluated and ranked, though most of them do not have properties such as feasibility in all cases, being unit invariant, ranking nonextreme efficient units, and finding strong Pareto-efficient projection for all units.

In this study, in order to calculate super efficiency of units and rank them, Anderson-Peterson's idea was utilized in two stages. In the first stage, the unit under evaluation was projected on production possibility set spanned by the rest of the DMUs and, in the second stage, the first projection point is transferred to a Pareto-efficient point. Then, by applying slack variables in the definition of super efficiency units were ranked. The introduced model in this paper has several advantages including having feasibility, obtaining a Pareto-efficient projection, and being unit invariant. The other advantage of the model is that it involves the amount of inefficiency in the amount of super efficiency and consequently affects ranking units in the case that the first projection point is placed on weak frontier. However, the problem of ranking nonextreme efficient units still remains. The proposed model is similar to SBM and as it was observed in previous sections, it is equivalent to Tone's model, though the obtained results are different due to the new definition of super efficiency.

Acknowledgment

The authors would like to express their deep gratitude to Professor Farhad Hoseinzadeh Lotfi, for his guidance, enthusiastic encouragement, and useful critiques of this research.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

References

[1] N. Adler, L. Friedman, 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.

[2] A. Charnes, W. W. Cooper, E. Rhodes, "Measuring the efficiency of decision making units," European Journal of Operational Research , vol. 2, no. 6, pp. 429-444, 1978.

[3] A. Charnes, W. W. Cooper, B. Golany, L. Seiford, J. Stutz, "Foundations of data envelopment analysis for Pareto-Koopmans efficient empirical production functions," Journal of Econometrics , vol. 30, no. 1-2, pp. 91-107, 1985.

[4] F. H. Lotfi, G. R. Jahanshahloo, M. Khodabakhshi, M. Rostamy-Malkhlifeh, Z. Moghaddas, M. Vaez-Ghasemi, "A review of ranking models in data envelopment analysis," Journal of Applied Mathematics , vol. 2013, 2013.

[5] R. D. Banker, A. Charnes, W. W. Cooper, "Some models for estimating technical and scale inefficiencies in data envelopment analysis," Management Science , vol. 30, no. 9, pp. 1078-1092, 1984.

[6] T. Sueyoshi, "DEA non-parametric ranking test and index measurement: slack-adjusted DEA and an application to Japanese agriculture cooperatives," Omega , vol. 27, no. 3, pp. 315-326, 1999.

[7] G. R. Jahanshahloo, M. Afzalinejad, "A ranking method based on a full-inefficient frontier," Applied Mathematical Modelling , vol. 30, no. 3, pp. 248-260, 2006.

[8] H. Orkcu, H. Bal, "Goal programming approaches for data envelopment analysis cross efficiency evaluation," Applied Mathematics and Computation , vol. 218, no. 2, pp. 346-356, 2011.

[9] W. R. Rodder, E. Reucher, "A consensual peer-based DEA-model with optimized cross-efficiencies: input allocation instead of radial reduction," European Journal of Operational Research , vol. 212, no. 1, pp. 148-154, 2011.

[10] N. Ramón, J. L. Ruiz, I. Sirvent, "Reducing differences between profiles of weights: a "peer-restricted" cross-efficiency evaluation," Omega , vol. 39, no. 6, pp. 634-641, 2011.

[11] J. Wu, J. Sun, L. Liang, Y. Zha, "Determination of weights for ultimate cross efficiency using Shannon entropy," Expert Systems with Applications , vol. 38, no. 5, pp. 5162-5165, 2011.

[12] J. Wu, J. Sun, L. Liang, "Cross efficiency evaluation method based on weight-balanced data envelopment analysis model," Computers and Industrial Engineering , vol. 63, no. 2, pp. 513-519, 2012.

[13] Y. Wang, K. Chin, 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.

[14] P. Andersen, N. C. Petersen, "A procedure for ranking efficient units in data envelopment analysis," Management Science , vol. 39, pp. 1261-1264, 1993.

[15] S. Mehrabian, M. R. Alirezaei, G. R. Jahanshahloo, "A complete efficiency ranking of decision making units: an application to the teacher training university," Computational Optimization and Applications , vol. 14, pp. 261-266, 1998.

[16] S. Li, G. R. Jahanshahloo, 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.

[17] F. Hosseinzadeh Lotfi, G. R. Jahanshahloo, 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 , vol. 1, pp. 44-54, 2000.

[18] G. R. Jahanshahloo, M. Sanei, F. Hosseinzadeh Lotfi, N. Shoja, "Using the gradient line for ranking DMUs in DEA," Applied Mathematics and Computation , vol. 151, no. 1, pp. 209-219, 2004.

[19] A. Amirteimoori, G. R. Jahanshahloo, S. Kordrostami, "Ranking of decision making units in data envelopment analysis: a distance-based approach," Applied Mathematics and Computation , vol. 171, no. 1, pp. 122-135, 2005.

[20] G. R. Jahanshahloo, H. Lotfi, F. Shoja, N. Tohidi, G. Razavian, "Ranking using norm in data envelopment analysis," Applied Mathematics and Computational , vol. 153, no. 1, pp. 215-224, 2004.

[21] G. R. Jahanshahloo, F. H. Lotfi, F. R. Balf, H. Z. Rezai, "Using Monte Carlo method for ranking efficient units," Applied Mathematics and Computation , vol. 162, pp. 371-372, 2005.

[22] G. R. Jahanshahloo, L. Pourkarimi, M. Zarepisheh, "Modified MAJ model for ranking decision making units in data envelopment analysis," Applied Mathematics and Computation , vol. 174, no. 2, pp. 1054-1059, 2006.

[23] G. R. Jahanshahloo, M. Soleimani-Damaneh, M. Reshadi, "On Pareto (dynamically) efficient paths," International Journal of Computer Mathematics , vol. 83, no. 8-9, pp. 631-635, 2006.

[24] F. Rezai Balf, H. Zhiani Rezai, G. R. Jahanshahloo, F. Hosseinzadeh Lotfi, "Ranking efficient DMUs using the Tchebycheff norm," Applied Mathematical Modelling , vol. 36, no. 1, pp. 46-56, 2012.

[25] S. J. Sadjadi, H. Omrani, S. Abdollahzadeh, M. Alinaghian, H. Mohammadi, "A robust super-efficiency data envelopment analysis model for ranking of provincial gas companies in Iran," Expert Systems with Applications , vol. 38, no. 9, pp. 10875-10881, 2011.

[26] K. Tone, "A slacks-based measure of super-efficiency in data envelopment analysis," European Journal of Operational Research , vol. 143, no. 1, pp. 32-41, 2002.

[27] J. Zhu, "Super-efficiency and DEA sensitivity analysis," European Journal of Operational Research , vol. 129, no. 2, pp. 443-455, 2001.

[28] A. Amirteimoori, "DEA efficiency analysis: efficient and anti-efficient frontier," Applied Mathematics and Computation , vol. 186, no. 1, pp. 10-16, 2007.

[29] T. Chen, C. Bao, C. Huang, I. Wang, "Efficiency decomposition with enhancing russell measure in data envelopment analysis," American Journal of Applied Sciences , vol. 7, no. 3, pp. 438-441, 2010.

[30] A. Gholam Abri, G. R. Jahanshahloo, F. Hosseinzadeh Lotfi, N. Shoja, M. Fallah Jelodar, "A new method for ranking non-extreme efficient units in data envelopment analysis," Optimization Letters , vol. 7, no. 2, pp. 309-324, 2013.

[31] G. R. Jahanshahloo, M. Sanei, N. Shoja, "Modified ranking models, using the concept of advantage in data envelopment analysis," Working Paper , 2004.

[32] C. Kao, "Weight determination for consistently ranking alternatives in multiple criteria decision analysis," Applied Mathematical Modelling , vol. 34, no. 7, pp. 1779-1787, 2010.

[33] M. Khodabakhshi, K. Aryavash, "Ranking all units in data envelopment analysis," Applied Mathematics Letters , vol. 25, no. 12, pp. 2066-2070, 2012.

[34] A. Ashrafi, A. B. Jaafar, L. S. Lee, M. R. A. Bakar, "An enhanced russell measure of super-efficiency for ranking efficient units in data envelopment analysis," American Journal of Applied Sciences , vol. 8, no. 1, pp. 92-96, 2011.

[35] Y. Chen, J. Du, J. Huo, "Super-efficiency based on a modified directional distance function," Omega , vol. 41, no. 3, pp. 621-625, 2013.

[36] Y. Chen, "Ranking efficient units in DEA," Omega , vol. 32, no. 3, pp. 213-219, 2004.

[37] Y. Chen, H. D. Sherman, "The benefits of non-radial vs. radial super-efficiency DEA: an application to burden-sharing amongst NATO member nations," Socio-Economic Planning Sciences , vol. 38, no. 4, pp. 307-320, 2004.

[38] Y. Chen, "Measuring super-efficiency in DEA in the presence of infeasibility," European Journal of Operational Research , vol. 161, no. 2, pp. 545-551, 2005.

[39] J.-X. Chen, M. Deng, S. Gingras, "A modified super-efficiency measure based on simultaneous inputoutput projection in data envelopment analysis," Computers and Operations Research , vol. 38, no. 2, pp. 496-504, 2011.

[40] W. D. Cook, L. Liang, Y. Zha, J. Zhu, "A modified super-efficiency DEA model for infeasibility," Journal of the Operational Research Society , vol. 60, no. 2, pp. 276-281, 2009.

[41] H.-S. Lee, C.-W. Chu, J. Zhu, "Super-efficiency DEA in the presence of infeasibility," European Journal of Operational Research , vol. 212, no. 1, pp. 141-147, 2011.

[42] H. Lee, J. Zhu, "Super-efficiency infeasibility and zero data in DEA," European Journal of Operational Research , vol. 216, no. 2, pp. 429-433, 2012.

[43] C. A. K. Lovell, A. P. B. Rouse, "Equivalent standard DEA models to provide super-efficiency scores," Journal of the Operational Research Society , vol. 54, no. 1, pp. 101-108, 2003.

[44] H. Morita, K. Hirokawa, J. Zhu, "A slack-based measure of efficiency in context-dependent data envelopment analysis," Omega , vol. 33, no. 4, pp. 357-362, 2005.

[45] A. A. Noura, F. Hosseinzadeh Lotfi, G. R. Jahanshahloo, S. Fanati Rashidi, "Super-efficiency in DEA by effectiveness of each unit in society," Applied Mathematics Letters , vol. 24, no. 5, pp. 623-626, 2011.

[46] K. Tone, "A slacks-based measure of efficiency in data envelopment analysis," European Journal of Operational Research , vol. 130, no. 3, pp. 498-509, 2001.