A procedure for large-scale DEA computations
From MaRDI portal
Publication:1000964
DOI10.1016/j.cor.2008.05.006zbMath1179.90177OpenAlexW2060267463MaRDI QIDQ1000964
Publication date: 12 February 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.05.006
Related Items (7)
Parallel processing of the Build Hull algorithm to address the large-scale DEA problem ⋮ Efficiency evaluation based on data envelopment analysis in the big data context ⋮ Big data efficiency analysis: improved algorithms for data envelopment analysis involving large datasets ⋮ Improving discrimination in data envelopment analysis without losing information based on Renyi's entropy ⋮ Data envelopment analysis and big data ⋮ Determining radial efficiency with a large data set by solving small-size linear programs ⋮ A unified model for detecting efficient and inefficient outliers in data envelopment analysis
Uses Software
Cites Work
- 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
- A computational study of DEA with massive data sets
- Efficient algorithm for additive and multiplicative models in data envelopment analysis
- A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space
- Parallel and hierarchical decomposition approaches for solving large-scale data envelopment analysis models
- Output-input ratio analysis and DEA frontier
- An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull
- On characterizing the production possibility set for the CCR ratio model in DEA
- Unnamed Item
This page was built for publication: A procedure for large-scale DEA computations
