maximal_friends: Maximal friends of a set of DMUs.

Description

Finds the maximal friends subsets of a given set of DMUs, according to Tone (2010). It uses a descending algorithm in order to find directly maximal subsets.

Usage

maximal_friends(datadea,
             dmu_ref = NULL,
             rts = c("crs", "vrs", "nirs", "ndrs"),
             tol = 1e-6,
             silent = FALSE)

Arguments

datadea

The data, including n DMUs, m inputs and s outputs.

dmu_ref

A numeric vector containing which DMUs are the evaluation reference set, i.e. the cluster of DMUs from which we want to find maximal friends. If NULL (default), all DMUs are considered.

rts

A string, determining the type of returns to scale, equal to "crs" (constant), "vrs" (variable), "nirs" (non-increasing) or "ndrs" (non-decreasing).

tol

Numeric, a tolerance margin for checking efficiency.

silent

Logical, if FALSE (default) steps are printed.

Value

A list with numeric vectors representing maximal friends subsets of DMUs.

References

Tone, K. (2010). "Variations on the theme of slacks-based measure of efficiency in DEA", European Journal of Operational Research, 200, 901-907. https://doi.org/10.1016/j.ejor.2009.01.027

Examples

Run this code

# NOT RUN {
data("PFT1981")
datadea <- read_data(PFT1981, ni = 5, no = 3)
# We find maximal friends of a cluster formed by the first 20 DMUs
result <- maximal_friends(datadea = datadea,
                          dmu_ref = 1:20)
# }
# NOT RUN {
 
# }