DEA with streaming data

Omega (United Kingdom)

Volumn 41, Issue 1, 2013, Pages 41-47

  Dula J H ^a   Lopez F J ^b  

^a VIRGINIA COMMONWEALTH UNIVERSITY   (United States)

^b MIDDLE GEORGIA STATE UNIVERSITY   (United States)

Author keywords

Data envelopment analysis (DEA); Linear programming (LP)

Indexed keywords

LINEAR PROGRAMMING;

DATA ENVELOPMENT ANALYSE; DATA SET; DATAPOINTS; FRONTIER ANALYSIS; LINEAR PROGRAMMING; LINEAR-PROGRAMMING; LOWER LIMITS; PROPERTY; STREAMING DATA; UPPER LIMITS;

DATA ENVELOPMENT ANALYSIS;

EID: 84866048251     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2011.07.010     Document Type: Article

References (22)

1. Ali I. Streamlined computation for data envelopment analysis. European Journal of Operational Research 1993, 64:61-67.
2. Athanassopoulos A.D., Curram S.P. A comparison of data envelopment analysis and artificial neural networks as tools for assessing the efficiency of decision making units. Journal of the Operational Research Society 1996, 47:1000-1016.
3. Barr R.S., Durchholz M.L. Parallel and hierarchical decomposition approaches for solving large-scale data envelopment analysis models. Annals of Operations Research 1997, 73:339-372.
4. Chang S.-J., Hsiao H.-C., Huang L.-H., Chang H. Taiwan quality indicator project and hospital productivity growth. Omega 2011, 39(1):14-22.
5. Cook W.D., Liang L., Zhu J. Measuring performance of two-stage network structures by DEA: a review and future perspective. Omega 2010, 38(6):423-430.
6. Cooper W.W., Ruiz J.L., Sirvent I. Choosing weights from alternative optimal solutions of dual multiplier models in DEA. European Journal of Operational Research 2007, 180:443-458.
7. Dantzig G.B. Linear programming and extensions 1963, Princeton University Press, Princeton, NJ.
8. Dulá J.H., Thrall R.M. A computational framework for accelerating DEA. Journal of Productivity Analysis 2001, 16:63-78.
9. Dulá J.H., López F.J. Algorithms for the frame of a finitely generated unbounded polyhedron. INFORMS Journal on Computing 2006, 18:97-110.
10. Dulá J.H. A computational study of DEA with massive data sets. Computers and Operations Research 2008, 35:1191-1203.
11. Dulá J.H., López F.J. Preprocessing DEA. Computers and Operations Research 2009, 36:1204-1220.
12. Dulá J.H. A geometrical approach for generalizing the production possibility set in DEA. Journal of the Operational Research Society 2009, 60:1546-1555.
13. Dulá J.H. An algorithm for data envelopment analysis. INFORMS Journal on Computing 2011, 23(2):284-296.
14. Gass S. Linear programming 1958, McGraw-Hill, New York.
15. IBM, CPLEX 12.2 〈〉; 2010. http://www-01.ibm.com/software/integration/optimization/cplex-optimizer.
16. Korhonen P.J., Siitari P.A. Using lexicographic parametric programming for identifying efficient units in DEA. Computers and Operations Research 2007, 34:2177-2190.
17. Korhonen P.J., Siitari P.A. A dimensional decomposition approach to identifying efficient units in large-scale DEA models. Computers and Operations Research 2009, 36:234-244.
18. Simon J., Simon C., Arias A. Changes in productivity of Spanish university libraries. Omega 2011, 39(5):578-588.
19. Ottmann T., Schuierer S., Soundaralakshimi S. Enumerating extreme points in higher dimension. Nordic Journal of Computing 2001, 8:179-192.
20. Po R.-W., Guh Y.-Y., Yang M.-S. A new clustering approach using data envelopment analysis. European Journal of Operational Research 2009, 199:276-284.
21. Poitier K., Cho S. Estimation of true efficient frontier of organisational performance using data envelopment analysis and support vector machine learning. International Journal of Information and Decision Sciences 2011, 3(2):148-172.
22. Yeh C.-C., Chi D.-J., Hsu M.-F. A hybrid approach of DEA, rough set and support vector machines for business failure prediction. Expert Systems with Applications 2010, 37(2):1535-1541.