Parallel processing of the Build Hull algorithm to address the large-scale DEA problem

Build Hull is currently one of the most efficient methods to address the large-scale data envelopment analysis problem. In this paper, the computational complexity of Build Hull is established, implying that the dimension of the data set has a strong influence on computational efficiency. Based on the complexity result, we find that the “worst density” of Build Hull monotonically increases with respect to dimension. In addition, a two-phase parallel Build Hull algorithm is proposed to enhance the computational efficiency of Build Hull. The parallel procedure is based on the minimum volume enclosing ellipsoid technique, which enables the exclusion of a large number of DMUs in the first phase. A sensitivity analysis-based technique is also proposed to substantially reduce computational time in the second phase. Numerical tests support our theoretical results.

[1]  Agha Iqbal Ali,et al.  Streamlined computation for data envelopment analysis , 1993 .

[2]  Wen-Chih Chen,et al.  Determining radial efficiency with a large data set by solving small-size linear programs , 2017, Ann. Oper. Res..

[3]  Yih-Long Chang,et al.  Efficient algorithm for additive and multiplicative models in data envelopment analysis , 1989 .

[4]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[5]  Wen-Chih Chen,et al.  A procedure for large-scale DEA computations , 2009, Comput. Oper. Res..

[6]  Angappa Gunasekaran,et al.  Big Data and supply chain management: a review and bibliometric analysis , 2018, Ann. Oper. Res..

[7]  José H. Dulá.  An Algorithm for Data Envelopment Analysis , 2011, INFORMS J. Comput..

[8]  Ali Emrouznejad,et al.  The origins, development and future directions of data envelopment analysis approach in transportation systems , 2020 .

[9]  Ali Emrouznejad,et al.  Evaluation of research in efficiency and productivity: A survey and analysis of the first 30 years , 2008 .

[10]  Abraham Charnes,et al.  Sensitivity analysis of the additive model in data envelopment analysis , 1990 .

[11]  Abraham Charnes,et al.  Sensitivity and stability analysis in dea , 1984, Ann. Oper. Res..

[12]  José H. Dulá,et al.  DEA with streaming data , 2013 .

[13]  Michael J. Todd,et al.  Minimum volume ellipsoids - theory and algorithms , 2016, MOS-SIAM Series on Optimization.

[14]  David C. Wheelock,et al.  Why do Banks Disappear? The Determinants of U.S. Bank Failures and Acquisitions , 2000, Review of Economics and Statistics.

[15]  Jie Wu,et al.  Efficiency evaluation based on data envelopment analysis in the big data context , 2017, Comput. Oper. Res..

[16]  Lianbiao Cui,et al.  Environmental performance evaluation with big data: theories and methods , 2016, Annals of Operations Research.

[17]  Marie-Laure Bougnol,et al.  Anchor points in DEA , 2009, Eur. J. Oper. Res..

[18]  J. Dulá,et al.  A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space , 1996 .

[19]  Richard S. Barr,et al.  Parallel and hierarchical decomposition approaches for solving large-scale Data Envelopment Analysis models , 1997, Ann. Oper. Res..

[20]  Jie Tao,et al.  Global linear convergent algorithm to compute the minimum volume enclosing ellipsoid , 2017, 1702.06254.

[21]  José H. Dulá,et al.  An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull , 1998, INFORMS J. Comput..

[22]  Russell G. Thompson,et al.  Chapter 7 DEA multiplier analytic center sensitivity with an illustrative application to independent oil companies , 1996, Ann. Oper. Res..

[23]  Jie Wu,et al.  An SBM-DEA model with parallel computing design for environmental efficiency evaluation in the big data context: a transportation system application , 2016, Annals of Operations Research.

[24]  José H. Dulá,et al.  A computational study of DEA with massive data sets , 2008, Comput. Oper. Res..

[25]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[26]  José H. Dulá,et al.  Preprocessing DEA , 2009, Comput. Oper. Res..

[27]  Boaz Golany,et al.  Foundations of data envelopment analysis for Pareto-Koopmans efficient empirical production functions , 1985 .

[28]  José H. Dulá,et al.  A Computational Framework for Accelerating DEA , 2001 .

[29]  Mehdi Toloo,et al.  Data envelopment analysis and big data , 2019, Eur. J. Oper. Res..

[30]  William W. Cooper,et al.  Introduction to Data Envelopment Analysis and Its Uses: With Dea-Solver Software and References , 2005 .