Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6896203 | European Journal of Operational Research | 2016 | 24 Pages |
Abstract
The literature on data envelopment analysis (DEA) often employs multiplier models that incorporate very small (theoretically infinitesimal) lower bounds on the input and output weights. Computational problems arising from the solution of such programs are well known. In this paper we identify an additional theoretical problem that may arise if such bounds are used in a multiplier model with weight restrictions. Namely, we show that the use of small lower bounds may lead to the identification of an efficient target with negative inputs. We suggest a corrected model that overcomes this problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Victor V. Podinovski, Tatiana Bouzdine-Chameeva,