We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
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
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.