Abstract
This paper deals with imprecise data in data envelopment analysis (DEA). We construct a new pair of mathematical programming models by using the concepts of ‘inf’ and ‘sup’ to calculate the exact values of the lower- and upper-bound efficiency scores in the presence of interval and ordinal data. The method proposed in this study is motivated by the approach introduced by Kao (Eur J Oper Res 174(2):1087–1099, 2006) where a pair of two-level mathematical DEA models are converted into linear programming (LP) models to calculate the lower- and upper-bound efficiency scores in the presence of pure ordinal data. We show that the LP model proposed by Kao (2006) for finding the lower-bound efficiency score yields the upper-bound efficiency score. We propose an improved model that overcomes this drawback and successfully calculates the lower- and upper-bound efficiency scores. We demonstrate the applicability of our models with a numerical example and exhibit its efficacy through comparison with Kao’s (2006) approach.
Original language | English |
---|---|
Pages (from-to) | 2719-2737 |
Number of pages | 19 |
Journal | Operational Research |
Volume | 21 |
Issue number | 4 |
DOIs | |
State | Published - Dec 2021 |
Externally published | Yes |
Keywords
- Data envelopment analysis
- Efficiency bounds
- Imprecise data
- Interval data
- Ordinal data