Two DEA Models Employment in IS Project Selection for Iran Ministry of Commerce
Author(s):
Abstract:
Selection of an appropriate set of Information System (IS) projects is a critical business activity which is very helpful to all organizations. In this paper, after describing real IS project selection problem of Iran Ministry of Commerce (MOC), we introduce two Data Envelopment Analysis (DEA) models. Then, we show applicability of introduced models for identifying most efficient IS project from 8 competing projects. Then, in order to provide further insight, results of two introduced models are compared. It is notable that using basic DEA models -CCR and BCC- decision maker is not able to find most efficient Decision Making Unit (DMU) since these models identify some of DMUs as efficient which their efficiency scores equal to 1. As an advantage, the applied models can identify most efficient IS (in constant and variable return to scale situations) by solving only one linear programming (LP). So these models are computationally efficient. It is while using the basic DEA models requires decision maker to solve a LP for each IS.
Language:
English
Published:
International Journal of Industrial Engineering and Productional Research, Volume:20 Issue: 1, Jun 2009
Page:
77
magiran.com/p684473
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 1,390,000ريال میتوانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.
In order to view content subscription is required
Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!