On Characterizing Solutions of Optimization Problems with Roughness in the Objective Functions
Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
Rough set theory expresses vagueness, not by means of membership, but employing a boundary region of a set. If the boundary region of a set is empty, it means that the set is crisp. Otherwise, the set is rough. Nonempty boundary region of a set means that our knowledge about the set is not sufficient to define the set precisely. In this paper, a rough programming (RP) problem is introduced where a rough function concept and its convexity and differentiability depending on the boundary region is studied. The RP problem is converted into two subproblems namely, lower and upper approximation problem. The Kuhn-Tucker. Saddle point of rough programming problem (RPP) is discussed. In addition, in the case of differentiability assumption the solution of the RP problem is investigated A numerical example is given to illustrate the methodology.
Keywords:
Language:
English
Published:
Fuzzy Optimzation and Modeling, Volume:3 Issue: 3, Summer 2022
Pages:
48 to 58
magiran.com/p2506692
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 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!