A multi-objective programming method for solving network DEA

•The multi-objective programming model is proposed as an alternative approach for solving network DEA.•The propositions concerning various cases of possible evaluation settings are developed.•Case studies are implemented to examine the network DEA models with multi-objective programming. This study...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied soft computing Ročník 24; s. 406 - 413
Hlavní autoři: Kao, Han-Ying, Chan, Chieh-Yu, Wu, Dong-Jyun
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.11.2014
Témata:
BCC
Case studies
CCR
Divisional efficiency
Multi-objective programming
Network DEA
Case studies
Divisional efficiency
BCC
CCR
Network DEA
Multi-objective programming
ISSN:1568-4946, 1872-9681
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 multi-objective programming model is proposed as an alternative approach for solving network DEA.•The propositions concerning various cases of possible evaluation settings are developed.•Case studies are implemented to examine the network DEA models with multi-objective programming. This study proposes the multi-objective programming (MOP) method for solving network DEA (NDEA) models. In the proposed method, the divisional efficiencies (within an organization) and the overall efficiency of the organization are formulated as separate objective functions in the multi-objective programming model. Compared with conventional DEA where the intermediate processes and products are ignored, this work measures the organization's overall efficiency without neglecting the efficiencies of its subunits. Two case studies demonstrate the proposed NDEA–MOP's utility in measuring the efficiencies of an organization with concerning interactive internal process.
ISSN:1568-4946
1872-9681
DOI:10.1016/j.asoc.2014.06.057