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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Croatian Operational Research Review Ročník 12; číslo 2; s. 131 - 137
Hlavní autoři: Akhlaghi, Reza, Rostamy-Malkhalifeh, Mohsen, Amirteimoori, Alireza, Kordrostami, Sohrab
Médium: Journal Article Paper
Jazyk:angličtina
Vydáno: Zagreb Croatian Operational Research Society (CRORS) 01.01.2021
Hrvatsko društvo za operacijska istraživanja
Croatian Operational Research Society
Témata:
ISSN:1848-0225, 1848-9931
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
267801
ISSN:1848-0225
1848-9931
DOI:10.17535/crorr.2021.0011