2019
DOI: 10.1016/j.eswa.2019.01.019
|View full text |Cite
|
Sign up to set email alerts
|

Universal efficiency scores in data envelopment analysis based on a robust approach

Abstract: We propose a novel DEA ranking based on a robust optimization viewpoint: the higher ranking for those DMU's that remain efficient even for larger simultaneous and independent variations of all data and vice versa. This ranking can be computed by solving generalized linear fractional programming problems, but we also present a tight linear programming approximation that preserves the order of rankings. We show many remarkable properties of our approach: It preserves the order of rankings compared to the classic… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
12
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 14 publications
(12 citation statements)
references
References 38 publications
0
12
0
Order By: Relevance
“…Many more models are proposed in the literature addressing various issues in DEA. A particulary convenient and elegant model is the Chebyshev distance model of Hladík (2019). It is based on the robust optimization viewpoint and has many attractive properties such as the super-efficiency, i.e.…”
Section: Data Envelopment Analysismentioning
confidence: 99%
See 4 more Smart Citations
“…Many more models are proposed in the literature addressing various issues in DEA. A particulary convenient and elegant model is the Chebyshev distance model of Hladík (2019). It is based on the robust optimization viewpoint and has many attractive properties such as the super-efficiency, i.e.…”
Section: Data Envelopment Analysismentioning
confidence: 99%
“…To obtain technical efficiencies, we utilize the Chebyshev distance DEA with variable returns to scale (VRS) proposed by Hladík (2019). Let X = (x i,j ) n,r i=1,k=1 be the non-negative matrix of inputs and Y = (y i,k ) n,s i=1,k=1 be the non-negative matrix of outputs.…”
Section: Chebyshev Distance Data Envelopment Analysismentioning
confidence: 99%
See 3 more Smart Citations