Variations on the theme of slacks-based measure of efficiency: Convex hull-based algorithms. (September 2021)
- Record Type:
- Journal Article
- Title:
- Variations on the theme of slacks-based measure of efficiency: Convex hull-based algorithms. (September 2021)
- Main Title:
- Variations on the theme of slacks-based measure of efficiency: Convex hull-based algorithms
- Authors:
- Xie, Qiwei
Zhu, Yuanchang
Shang, Haichao
Li, Yongjun - Abstract:
- Highlights: Non-radial data envelopment analysis models always overestimate inefficiencies of decision-making units and bring them far benchmarks. This paper proposes several algorithms based on a convex hull algorithmand applies the algorithms to a real dataset. Abstract: Non-radial data envelopment analysis (DEA) models, such as the slacks-based measure (SBM) model, exert an important role in theoretical research and real applications on efficiency evaluation and improvement. However, those models maximize input and output slacks and may therefore find a rather far projection for each inefficient decision-making unit (DMU). This results in varying performance measures and inconveniences in improving the performance of inefficient DMUs. Tone (2016) proposed a new non-oriented SBM-Max model and several algorithms to overcome such limitations. However, those algorithms were computationally expensive and complicated, limiting their applications to different problems. In the present study, algorithms are proposed based on two convex hull algorithms to make a novel variation of (Tone, 2016) that is easily applicable to different problems. The proposal is based on the constant returns-to-scale (CRS) assumption. The algorithms can be further extended based on other assumptions of returns to scale. The used two convex hull algorithms were the Quickhull (Qhull) algorithm and the C++ (ANSI C) implementation of the double description (CDD) algorithm. The proposed algorithms wereHighlights: Non-radial data envelopment analysis models always overestimate inefficiencies of decision-making units and bring them far benchmarks. This paper proposes several algorithms based on a convex hull algorithmand applies the algorithms to a real dataset. Abstract: Non-radial data envelopment analysis (DEA) models, such as the slacks-based measure (SBM) model, exert an important role in theoretical research and real applications on efficiency evaluation and improvement. However, those models maximize input and output slacks and may therefore find a rather far projection for each inefficient decision-making unit (DMU). This results in varying performance measures and inconveniences in improving the performance of inefficient DMUs. Tone (2016) proposed a new non-oriented SBM-Max model and several algorithms to overcome such limitations. However, those algorithms were computationally expensive and complicated, limiting their applications to different problems. In the present study, algorithms are proposed based on two convex hull algorithms to make a novel variation of (Tone, 2016) that is easily applicable to different problems. The proposal is based on the constant returns-to-scale (CRS) assumption. The algorithms can be further extended based on other assumptions of returns to scale. The used two convex hull algorithms were the Quickhull (Qhull) algorithm and the C++ (ANSI C) implementation of the double description (CDD) algorithm. The proposed algorithms were tested on a dataset from prior literature and a real dataset of Hong Kong hospitals. The results demonstrate that the proposed algorithms are effective for finding a close projection on efficiency evaluation, resulting in improvements in DMUs. … (more)
- Is Part Of:
- Computers & industrial engineering. Volume 159(2021)
- Journal:
- Computers & industrial engineering
- Issue:
- Volume 159(2021)
- Issue Display:
- Volume 159, Issue 2021 (2021)
- Year:
- 2021
- Volume:
- 159
- Issue:
- 2021
- Issue Sort Value:
- 2021-0159-2021-0000
- Page Start:
- Page End:
- Publication Date:
- 2021-09
- Subjects:
- Data envelopment analysis (DEA) -- Slacks-based measure (SBM) -- Quickhull (Qhull) algorithm -- C++ implementation of the double description (CDD) algorithm -- Convex hull algorithm -- Efficient facets
Engineering -- Data processing -- Periodicals
Industrial engineering -- Periodicals
620.00285 - Journal URLs:
- http://www.sciencedirect.com/science/journal/03608352 ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.cie.2021.107474 ↗
- Languages:
- English
- ISSNs:
- 0360-8352
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3394.713000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 17785.xml