Radial Big Data Models

When the number of decision-making units is large, traditional DEA models are slow to solve. Khezrimotlagh, Zhu, Cook, and Toloo (2019), propose a framework that reduces the computational time by finding the set of best practices DMUs from a subsample and evaluating the rest of the decision-making units with respect to the best performers.

The proposed framework includes five steps:

1. Select a subsample of DMU.
2. Find the best practices in the subsample.
3. Find the exterior DMUs with respect to the hull of the best practices.
4. Identify the set of all efficient DMUs.
5. Calculate performance scores as in the traditional DEA model.

This example computes the Big Data radial input-oriented DEA model under variable returns to scale, using random data drawn from a uniform distribution. 500 DMUs with six inputs and four outputs in the interval (10, 20) are generated:

# Generate random data
using DataEnvelopmentAnalysis
using Distributions
using Random
using StableRNGs

rng = StableRNG(1234567)
X = rand(Uniform(10, 20), 500, 6);
Y = rand(Uniform(10, 20), 500, 4);

# Calculate the Big Data DEA Model
deabig = deabigdata(X, Y)

# Get efficiency scores
efficiency(deabig)

500-element Vector{Float64}:
 0.9520332186924739
 1.0
 0.9201599511684775
 0.9036264873331524
 0.8749338818730398
 0.8712669397313069
 0.9054343849397112
 0.8989481195303693
 1.0
 0.9741363634357773
 ⋮
 0.6943926387389557
 0.790019703606659
 0.7722496164824484
 0.9744333432163308
 0.9312246685035822
 0.818207801158198
 0.7157230060668631
 0.9235869596274705
 0.8405485325769086

deabigdata Function Documentation

deabigdata(X, Y)