کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9507287 | 1340776 | 2005 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A feasible interval for weights in data envelopment analysis
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In data envelopment analysis (DEA), sometimes it is required to impose restriction on weights based on the judgement of the decision maker (DM). These additional constraints may result in infeasibility of the model. Small alteration of the bounds will ensure the feasibility of the model. This alteration must be minimized in order to retain the preferences of DM. By using goal programming (GP) technique and exploiting big-M method, a set of weights are obtained for which the corresponding problem will be always feasible. It has been shown that the sum of deviations of these weights from managerial willingness is minimum. An empirical study using real data shows the robutness of the algorithm.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 160, Issue 1, 5 January 2005, Pages 155-168
Journal: Applied Mathematics and Computation - Volume 160, Issue 1, 5 January 2005, Pages 155-168
نویسندگان
G.R. Jahanshahloo, A. Memariani, F. Hosseinzadeh, N. Shoja,