R O B U S T M O D E L S F O R I N T E R V A L C O M P A R I S O N M A T R I X I N A H P
Author(s):
Abstract:
One of the classical paradigms in decision making models is to develop a model with deterministic values for input data. However, in practical cases, inaccurate data may lead to either impractical decisions or weak solutions. The Analytical Hierarchy Process (AHP) is one of the most widely used techniques in Multi Criteria Decision Theory. Since, in AHP, interval judgments can be used to deal with uncertainty in a model, a robust model is required to extract appropriate weights from the corresponding interval comparison matrices. In this paper, two robust models are presented to reduce inconsistency and errors in the interval comparison matrix. The first model is based on robust optimization with a budgeted uncertainty set that generates point estimation weights. The second model is based on goal programming that extracts interval weights from interval comparison matrices. Hopefully, both models can be converted to linear programming problems. Experimental results on both models show that our proposed models can extract appropriate and robust solutions for comparison matrices of AHP under different circumstances.
Language:
Persian
Published:
Industrial Engineering & Management Sharif, Volume:26 Issue: 1, 2010
Pages:
65 to 81
magiran.com/p798393
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 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!