A New Model for Determining Anchor Points in Data Envelopment Analysis


Department of Mathematics, Sistan and Baluchestan University, Zahedan, Iran


Data envelopment analysis (DEA) is a method for evaluating performance of organizations and decision making units (DMUs). This method divide decision making units (DMUs) in four different categories: inefficient, weak efficient, extreme efficient and non-extreme efficient. In this paper, we investigate a new DMU category which called "anchor point". An anchor point places on common region between the efficiency frontier and free-disposability. Indeed, an anchor point is extreme efficient which makes weak efficiency frontier. Omission of the anchor points will change efficiency frontier and eliminate a region of generating possibility set. Anchor point also has another characteristic, changing its input or output will change efficiency frontier and by increasing input or decreasing output, the new point will be still on frontier and is extreme efficient. Therefore, the characteristics of the anchor point demonstrate its importance. As for its importance, we propose faster methods to identify these points. At first, we express identifying algorithms for these points and then by using their characteristics, we propose some methods like supper efficiency method which identifies anchor points by using less calculation than others. We will give a numerical example to explain proposed method and compare it with other methods.


[1] Allen, R. and Thanassoulis, E. (2004). Improving envelopment in data envelopment analysis, European Journal of Operational Research, 154(4), 363-379. [2] Bognol, M.L. and Dula, J.H. (2009). Anchor points in DEA, European Journal of Operational Research. 192, 668-676. [3] Cooper, W.W., Seiford, L. and Tone, K. (2007). Data envelopment analysis: A Comprehensive Text
with Models, Reference and DEASolver Software, Springer, New York. [4] Charnes, A., Cooper, W.W. and Rhodes, E. (1978). Measuring the efficiencies of DMUs, European Journal of Operational Research, 2(6), 429-444. [5] Anderson, P. and Petersen,
N.C. (1993).A procedure for ranking efficient unite in data envelopment analysis, Management Science, 39, 1261– 1264. [6] Hosseinzadeh Lotfi, F., Jahanshahloo, G.R., Moradi, F. and Jannati, F. (2010). An Alternative Algorithm for Detecting
Anchorpoints, Internathional Mathematical Forum, 5, 3371 - 3377 [7] Bazaraa, M.S., Jarvis, J. and Sherali, H.(1977). Linear
Programming and network flows. John wiely& sons, NewYork [8]Jahanshahloo, G.R., Hossinzadeh Lotfi, F. and Akbarian, D.
(2010). Finding weak defining hyperplane of pps of the BCC modle, Applied Mathemathical Modelling, 34, 3321-3332. [9]
Jahanshahloo, G.R., Shirzadi, A. and Mirdehghan, S.M. (2009). Finding strong defining hyperplanes of pps using multiplier form, European