.png){kind=icon}
返回
Network DEA smallest improvement approach
.png){kind=icon}
PRE
AI
DOI：10.1016/j.omega.2019.102140.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper the smallest improvement DEA approach to general networks of processes is proposed. The corresponding projection direction is endogenously computed by the model so that the relative distance to the frontier is minimal. Both the cooperative and the non-cooperative scenarios for the intermediate products are considered. For the cooperative case, the computed inefficiency score can be decomposed into the sum of the inefficiency scores of the different processes. For the non-cooperative scenario, an alternative decomposition based on the inefficiency of the different intermediate products is also presented. The proposed approach has been validated on different network DEA configurations. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Network Data Envelopment Analysis
Endogenous directional distance function
Smallest improvement
Efficiency decomposition
Intermediate products inefficiency
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
O
IF:
7.2
论文数:
3.8K
被引数:
1.4W
机构
引用论文
.png){kind=icon}
查看更多内容