Multidimensional frontier visualization based on optimization methods using parallel computations

In data envelopment analysis, methods for constructing sections of the frontier have been recently proposed to visualize the production possibility set. The aim of this paper is to develop, prove and test the methods for the visualization of production possibility sets using parallel computations. In this paper, a general scheme of the algorithms for constructing sections (visualization) of production possibility set is proposed. In fact, the algorithm breaks the original large-scale problems into parallel threads, working independently, then the piecewise solution is combined into a global solution. An algorithm for constructing a generalized production function is described in detail.

[1]  Kaisa Miettinen,et al.  Visualizing the Pareto Frontier , 2008, Multiobjective Optimization.

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

[3]  Vladimir E. Krivonozhko,et al.  On some generalization of the DEA models , 2009, J. Oper. Res. Soc..

[4]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[5]  Lennart Hjalmarsson,et al.  Calculation of scale elasticities in DEA models: direct and indirect approaches , 2007 .

[6]  A. V. Volodin,et al.  Constructions of economic functions and calculations of marginal rates in DEA using parametric optimization methods , 2004, J. Oper. Res. Soc..

[7]  Ali Emrouznejad,et al.  A survey and analysis of the first 40 years of scholarly literature in DEA: 1978–2016 , 2018 .

[8]  Abraham Charnes,et al.  Measuring the efficiency of decision making units , 1978 .

[9]  A. V. Volodin,et al.  About the structure of boundary points in DEA , 2005, J. Oper. Res. Soc..

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

[11]  O. B. Utkin,et al.  Set-to-set maps in efficiency analysis of complex systems , 2010 .

[12]  Patrick L. Brockett,et al.  Identification of Pareto-efficient facets in data envelopment analysis , 1998, Eur. J. Oper. Res..

[13]  Juan Aparicio,et al.  Benchmarking in Data Envelopment Analysis: An Approach Based on Genetic Algorithms and Parallel Programming , 2014, Adv. Oper. Res..

[14]  Alireza Amirteimoori,et al.  A distance-based measure of super efficiency in data envelopment analysis: an application to gas companies , 2012, J. Glob. Optim..

[15]  A. Charnes,et al.  Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis , 1984 .

[16]  G. C. Shephard,et al.  Convex Polytopes and the Upper Bound Conjecture , 1971 .

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

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

[19]  Oleg Sukhoroslov,et al.  A Web-Based Platform for Publication and Distributed Execution of Computing Applications , 2015, 2015 14th International Symposium on Parallel and Distributed Computing.

[20]  Hirotaka Nakayama,et al.  Generation of Pareto optimal solutions using generalized DEA and PSO , 2016, J. Glob. Optim..

[21]  W. Cooper,et al.  Data Envelopment Analysis: A Comprehensive Text with Models, Applications, References and DEA-Solver Software , 1999 .