A Linear Programming Relaxation DEA Model for Selecting a Single Efficient Unit with Variable RTS Technology
The selection-based problem is a type of decision-making issue which involves opting for a single option among a set of available alternatives. In order to address the selection-based problem in data envelopment analysis (DEA), various integrated mixed binary linear programming (MBLP) models have be...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Croatian Operational Research Society
2021-01-01
|
| Series: | Croatian Operational Research Review |
| Subjects: | |
| Online Access: | https://hrcak.srce.hr/file/388814 |
| Summary: | The selection-based problem is a type of decision-making issue which involves opting for a single option among a set of available alternatives. In order to address the selection-based problem in data envelopment analysis (DEA), various integrated mixed binary linear programming (MBLP) models have been developed. Recently, an MBLP model has been proposed to select a unit in DEA with variable returns-to-scale technology. This paper suggests utilizing the linear programming relaxation model rather than the MBLP model. The MBLP model is proved here to be equivalent to its linear programming relaxation problem. To the best of the authors’ knowledge, this is the first linear programming model suggested for selecting a single efficient unit in DEA under the VRS (Variable Returns to Scale) assumption. Two theorems and a numerical example are provided to validate the proposed LP model from both theoretical and practical perspectives. |
|---|---|
| ISSN: | 1848-0225 1848-9931 |