Identifying the anchor points in DEA using sensitivity analysis in linear programming |
| |
| Authors: | A Mostafaee M Soleimani-damaneh |
| |
| Institution: | 1. Department of Mathematics, College of Science, Tehran North Branch, Islamic Azad University, Tehran, Iran;2. School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Enghelab Avenue, Tehran, Iran |
| |
| Abstract: | 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. |
| |
| Keywords: | Data envelopment analysis Anchor point Extreme point Sensitivity analysis Linear programming |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
