.png){kind=icon}
返回
Identifying the anchor points in DEA using sensitivity analysis in linear programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2014.02.046.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, the anchor points in DEA, as an important subset of the set of extreme efficient points of the production possibility set (PPS), are studied. A basic definition, utilizing the multiplier DEA models, is given. Then, two theorems are proved which provide necessary and sufficient conditions for characterization of these points. The main results of the paper lead to a new interesting connection between DEA and sensitivity analysis in linear programming theory. By utilizing the established theoretical results, a successful procedure for identification of the anchor points is presented. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Data envelopment analysis
Anchor point
Extreme point
Sensitivity analysis
Linear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容