TY - CHAP
T1 - Data Envelopment Analysis and Big Data
T2 - Revisit with a Faster Method
AU - Khezrimotlagh, Dariush
AU - Zhu, Joe
N1 - Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020
Y1 - 2020
N2 - Khezrimotlagh et al. (Eur J Oper Res 274(3):1047–1054, 2019) propose a new framework to deal with large-scale data envelopment analysis (DEA). The framework provides the fastest available technique in the DEA literature to deal with big data. It is well known that as the number of decision-making units (DMUs) or the number of inputs–outputs increases, the size of DEA linear programming problems increases; and thus, the elapsed time to evaluate the performance of DMUs sharply increases. The framework selects a subsample of DMUs and identifies the set of all efficient DMUs. After that, users can apply DEA models with known efficient DMUs to evaluate the performance of inefficient DMUs or benchmark them. In this study, we elucidate their proposed method with transparent examples and illustrate how the framework is applied. Additional simulation exercises are designed to evaluate the performance of the framework in comparison with the performance of the two former methods: build hull (BH) and hierarchical decomposition (DH). The disadvantages of BH and HD are transparently demonstrated. A single computer with two different CPUs is used to run the methods. For the first time in the literature, we consider the cardinalities, 200,000, 500,000 and 1,000,000 DMUs.
AB - Khezrimotlagh et al. (Eur J Oper Res 274(3):1047–1054, 2019) propose a new framework to deal with large-scale data envelopment analysis (DEA). The framework provides the fastest available technique in the DEA literature to deal with big data. It is well known that as the number of decision-making units (DMUs) or the number of inputs–outputs increases, the size of DEA linear programming problems increases; and thus, the elapsed time to evaluate the performance of DMUs sharply increases. The framework selects a subsample of DMUs and identifies the set of all efficient DMUs. After that, users can apply DEA models with known efficient DMUs to evaluate the performance of inefficient DMUs or benchmark them. In this study, we elucidate their proposed method with transparent examples and illustrate how the framework is applied. Additional simulation exercises are designed to evaluate the performance of the framework in comparison with the performance of the two former methods: build hull (BH) and hierarchical decomposition (DH). The disadvantages of BH and HD are transparently demonstrated. A single computer with two different CPUs is used to run the methods. For the first time in the literature, we consider the cardinalities, 200,000, 500,000 and 1,000,000 DMUs.
UR - http://www.scopus.com/inward/record.url?scp=85086119521&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85086119521&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-43384-0_1
DO - 10.1007/978-3-030-43384-0_1
M3 - Chapter
AN - SCOPUS:85086119521
T3 - International Series in Operations Research and Management Science
SP - 1
EP - 34
BT - International Series in Operations Research and Management Science
PB - Springer
ER -