Abstract
Imposing additional weight restrictions increases the degeneracy and computational complexity of solving Data Envelopment Analysis (DEA) models, a known class of linear programming models. In this paper some linear transformations to reduce these problems are provided.
Similar content being viewed by others
References
Allen, R., Athanassopoulos, A., Dyson, R. G., & Thanassoulis, E. (1997). Weights restrictions and value judgments in DEA: evolution, development and future directions. Annals of Operations Research, 73, 13–34.
Banker, R. D., Charnes, A., & Cooper, W. W. (1984). Some models for estimating technical and scale efficiencies in data envelopment analysis. Management Science, 30, 1078–1092.
Bazaraa, M. S., Jarvis, J. J., & Sherali, H. D. (1990). Linear programming and network flows (2nd ed.). New York: Wiley.
Charnes, A., Cooper, W. W., & Rhodes, E. (1978). Measuring the efficiency of decision making units. European Journal of Operational Research, 2, 429–444.
Cooper, W. W., Sieford, L. M., & Tone, K. (2000). Data envelopment analysis: A comprehensive text with models, applications, references and DEA solver software. Dordrecht: Kluwer Academic.
Dyson, R. G., Allen, R., Camanho, A. S., Podinovski, V. V., Sarrico, C. S., & Shale, E. A. (2001). Pitfalls and protocols in DEA. European Journal of Operational Research, 132, 245–259.
Golany, B. (1988). A note on including ordinal relations among multipliers in DEA. Management Science, 34, 1029–1033.
Jahanshahloo, G. R., & Soleimani-damaneh, M. (2005). A note on simulating weights restrictions in DEA: an improvement of Thanassoulis and Allen’s method. Computers and Operations Research, 32, 1037–1044.
Thanassoulis, E., & Allen, R. (1998). Simulating weights restrictions in data envelopment analysis by means of unobserved DMUs. Management Science, 44(4), 586–594.
Thompson, R. G., Langemeier, L., Lee, C., Lee, E., & Thrall, E. (1980). The role of multiplier bounds in efficiency analysis with applications to Kansan farming. Journal of Econometrics, 46, 93–108.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Soleimani-damaneh, M., Zarepisheh, M. Linear transformations to decrease computational requirements of solving some known linear programming models. Ann Oper Res 172, 37–43 (2009). https://doi.org/10.1007/s10479-008-0473-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-008-0473-4