Skip to main content

An Approach for Determining DEA Efficiency Bounds

  • Conference paper
Multi-Objective Programming and Goal Programming

Part of the book series: Advances in Soft Computing ((AINSC,volume 21))

Abstract

Constrained facet analysis is used to evaluate decision making units (DMUs) which have non-zero slacks in data envelopment analysis (DEA) by requiring a full dimensional efficient facet (FDEF). The current paper shows that the FDEF-based approach may deem those extreme efficient DMUs which are not located on any FDEF as inefficient. Using strong complementary slackness condition (SCSC) solutions, this paper develops an alternative method for the treatment of non-zero slack values in DEA. The newly proposed method can deal with the situation when FDEFs do not exist.

Joe Zhu wants to thank the financial support from the Japan Society for Promotion of Science (JSPS). The paper was finished while Joe Zhu was visiting the Osaka University under the JSPS Invitation Research Fellowship.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bessent, A., Bessent, W., Elam, J., and Clark, T. (1988), “Efficiency frontier determination by constrained facet analysis”, Operations Research 36 /5, 785–796.

    Article  MATH  Google Scholar 

  • Chang, K.P., and Guh, Y.Y. (1991), “Linear production functions and data envelopment analysis ”, European Journal of Operational Research 52, 215–223.

    Article  MATH  Google Scholar 

  • Charnes, A., and Cooper, W.W. (1962), “Programming with linear fractional functions”, Naval Res. Logist. Quart. 9, 181–186.

    Article  MathSciNet  MATH  Google Scholar 

  • Charnes, A., Cooper, W.W., and Rhodes, E. (1978), “Measuring the efficiency of decision making units”, European Journal of Operational Research 2 /6, 429–444.

    Article  MathSciNet  MATH  Google Scholar 

  • Charnes, A., Cooper, W.W., and Thrall, R.M. (1991), “A structure for classifying and characterizing efficiency and inefficiency in data envelopment analysis”, Journal of Productivity Analysis 2, 197–237.

    Article  Google Scholar 

  • Green, R.H., Doyle, J.R., and Cook, W.D. (1996), “Efficiency bounds in data envelopment analysis”, European Journal of Operational Research 89, 482–490.

    Article  MATH  Google Scholar 

  • Roll, Y., Cook, W.D. and Golany, B. (1991), “Controlling factor weights in data envelopment analysis”, IIE Transaction 23, 2–9.

    Article  Google Scholar 

  • Seiford, L.M. and J. Zhu (1999), “Infeasibility of super-efficiency data envelopment analysis models,” INFOR 37 (May) 174–187.

    Google Scholar 

  • Thrall, R. M. (1996), “Duality, classification and slacks in DEA,” Annals of Operations Research 66 109–138.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Y., Morita, H., Zhu, J. (2003). An Approach for Determining DEA Efficiency Bounds. In: Multi-Objective Programming and Goal Programming. Advances in Soft Computing, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-36510-5_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-36510-5_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00653-4

  • Online ISBN: 978-3-540-36510-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics