A computational study of DEA with massive data sets

DOI10.1016/j.cor.2006.07.011zbMath1157.90479OpenAlexW1974899953MaRDI QIDQ941542

José H. Dulá

Publication date: 1 September 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.07.011

zbMATH Keywords

linear programmingconvex analysisdata envelopment analysis (DEA)

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear programming (90C05)

Related Items (16)

Parallel processing of the Build Hull algorithm to address the large-scale DEA problem ⋮ Multidimensional frontier visualization based on optimization methods using parallel computations ⋮ Efficiency evaluation of very large-scale samples: data envelopment analysis with angle-index synthesis ⋮ Competing output-sensitive frame algorithms ⋮ RED: a new method for performance ranking of large decision making units ⋮ Generalizing cross redundancy in data envelopment analysis ⋮ Enumeration algorithms for FDH directional distance functions under different returns to scale assumptions ⋮ Improving discrimination in data envelopment analysis without losing information based on Renyi's entropy ⋮ Preprocessing DEA ⋮ Data envelopment analysis and big data ⋮ Determining radial efficiency with a large data set by solving small-size linear programs ⋮ Interior point methods in DEA to determine non-zero multiplier weights ⋮ Data envelopment analysis of multiple response experiments ⋮ Aggregation of inputs and outputs prior to data envelopment analysis under big data ⋮ A procedure for large-scale DEA computations ⋮ A unified model for detecting efficient and inefficient outliers in data envelopment analysis

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• Measuring the efficiency of decision making units
• Streamlined computation for data envelopment analysis
• Foundations of data envelopment analysis for Pareto-Koopmans efficient empirical production functions
• An effective non-Archimedean anti-degeneracy/cycling linear programming method especially for data envelopment analysis and like models
• Parallel and hierarchical decomposition approaches for solving large-scale data envelopment analysis models
• Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron
• Solving Real-World Linear Programs: A Decade and More of Progress
• Effects of excluding the column being scored from the DEA envelopment LP technology matrix
• Nonparametric frontier analysis with multiple constituencies
• A slacks-based measure of efficiency in data envelopment analysis

This page was built for publication: A computational study of DEA with massive data sets