A powerful discriminative approach for selecting the most efficient unit in DEA

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27510%2F18%3A10240991" target="_blank" >RIV/61989100:27510/18:10240991 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.cie.2017.11.011" target="_blank" >http://dx.doi.org/10.1016/j.cie.2017.11.011</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.cie.2017.11.011" target="_blank" >10.1016/j.cie.2017.11.011</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A powerful discriminative approach for selecting the most efficient unit in DEA

Popis výsledku v původním jazyce

Data envelopment analysis (DEA) is a mathematical approach deals with the performance evaluation problem. Traditional DEA models partition the set of units into two distinct sets: efficient and inefficient. These models fail to get more information about efficient units whereas there are some applications, known as selection-based problems, where the concern is selecting only a single efficient unit. To address the problem, several mixed integer linear/nonlinear programming models are developed in the literature using DEA. The aim of all these approaches is formulating a model with more discriminating power. This paper presents a new nonlinear mixed integer programming model with significantly higher discriminating power than the existing ones in the literature. The suggested model lets the efficiency score of only a single unit be strictly greater than one. It is observed that the discrimination power of the model is high enough for fully ranking all units. More importantly, a linearization technique is used to formulate an equivalent mixed integer linear programming model which significantly decreases the computational burden. Finally, to validate the proposed model and also compare with some recent approaches, two numerical examples are utilized from the literature. Our founding points out the superiority of our model over all the previously suggested models from both theoretical and practical standpoints.

Název v anglickém jazyce

A powerful discriminative approach for selecting the most efficient unit in DEA

Popis výsledku anglicky

Data envelopment analysis (DEA) is a mathematical approach deals with the performance evaluation problem. Traditional DEA models partition the set of units into two distinct sets: efficient and inefficient. These models fail to get more information about efficient units whereas there are some applications, known as selection-based problems, where the concern is selecting only a single efficient unit. To address the problem, several mixed integer linear/nonlinear programming models are developed in the literature using DEA. The aim of all these approaches is formulating a model with more discriminating power. This paper presents a new nonlinear mixed integer programming model with significantly higher discriminating power than the existing ones in the literature. The suggested model lets the efficiency score of only a single unit be strictly greater than one. It is observed that the discrimination power of the model is high enough for fully ranking all units. More importantly, a linearization technique is used to formulate an equivalent mixed integer linear programming model which significantly decreases the computational burden. Finally, to validate the proposed model and also compare with some recent approaches, two numerical examples are utilized from the literature. Our founding points out the superiority of our model over all the previously suggested models from both theoretical and practical standpoints.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2018

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Computers and Industrial Engineering

ISSN

0360-8352

e-ISSN

—

Svazek periodika

115

Číslo periodika v rámci svazku

January

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

9

Strana od-do

269-277

Kód UT WoS článku

000425075400022

EID výsledku v databázi Scopus

2-s2.0-85035787080