An Epsilon-free Approach for Finding 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%2F14%3A86092172" target="_blank" >RIV/61989100:27510/14:86092172 - isvavai.cz</a>

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

An Epsilon-free Approach for Finding the Most Efficient Unit in DEA

Popis výsledku v původním jazyce

Data envelopment analysis (DEA), considering the best condition for each decision making unit (DMU), assesses the relative efficiency and partitions DMUs into two sets: efficient and inefficient. Practically, in traditional DEA models more than one efficient DMU are recognized and these models cannot rank efficient DMUs. Some studies have been carried out aiming at ranking efficient DMUs, although in some cases only discrimination of the most efficient unit is desirable. Furthermore, several investigations have been done for finding the most CCR-efficient DMU. The basic idea of the majority of them is to introduce an integrated model which achieves an optimal common set of weights (CSW). These weights help us identify the most efficient unit in an identical condition. Recently, Toloo (2012) [13] proposed a new mixed integer programming (MIP) model to find the most BCC-efficient unit. Based on this study, we propose a new basic integrated linear programming (LP) model to identify candid

Název v anglickém jazyce

An Epsilon-free Approach for Finding the Most Efficient Unit in DEA

Popis výsledku anglicky

Data envelopment analysis (DEA), considering the best condition for each decision making unit (DMU), assesses the relative efficiency and partitions DMUs into two sets: efficient and inefficient. Practically, in traditional DEA models more than one efficient DMU are recognized and these models cannot rank efficient DMUs. Some studies have been carried out aiming at ranking efficient DMUs, although in some cases only discrimination of the most efficient unit is desirable. Furthermore, several investigations have been done for finding the most CCR-efficient DMU. The basic idea of the majority of them is to introduce an integrated model which achieves an optimal common set of weights (CSW). These weights help us identify the most efficient unit in an identical condition. Recently, Toloo (2012) [13] proposed a new mixed integer programming (MIP) model to find the most BCC-efficient unit. Based on this study, we propose a new basic integrated linear programming (LP) model to identify candid

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

AE - Řízení, správa a administrativa

OECD FORD obor

—

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í

2014

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

Applied Mathematical Modelling

ISSN

0307-904X

e-ISSN

—

Svazek periodika

13

Číslo periodika v rámci svazku

38

Stát vydavatele periodika

BE - Belgické království

Počet stran výsledku

11

Strana od-do

3182-3192

Kód UT WoS článku

000338179900010

EID výsledku v databázi Scopus

—