A box-uncertainty in multi-objective optimization: an ε-constraint approach
Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
In the last few decades there has been lots of discussion in the literature regarding robust optimization. Since Epsilon constraint is one of the most important technique in interactive problems, therefore in this paper, due to the importance of robust optimization and multi-objective programming problems, we consider Multi-Objective Linear Fractional Programming (MOLFP) problem in the presence of box-uncertainty in the coefficients of the objective functions. We propose an approach based on ε-constraint and Charnes-Cooper methods to obtain weakly robust efficient solutions, that have special importance in the literature, for a MOLFP problems in the presence of uncertain data. Charnes-cooper method is applied to reduce a fractional programm to a non fractional programm. At the end we write the robust counterpart of the UMOLFP model in the presence of the box-uncertainty and it's equivalent linear programming problem: Finally a numerical example is used to show the usefulness of the proposed approach.
Keywords:
Language:
English
Published:
New research in Mathematics, Volume:8 Issue: 36, 2022
Pages:
129 to 138
magiran.com/p2558206
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 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!