A quadratic optimization problem with bipolar fuzzy relation equation constraints

سال انتشار: 1401
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 147

فایل این مقاله در 16 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

JR_IJFS-19-6_010

تاریخ نمایه سازی: 17 آبان 1401

چکیده مقاله:

This paper studies the quadratic programming problem subject to asystem of bipolar fuzzy relation equations with the max-productcomposition. A characterization of structure of its feasible domain is presented using the lower and upper bound vector on its solution set. A sufficient condition is proposed which under the condition, a component of one of its optimal solutions is the corresponding component of either the lower or upper bound vector. Some sufficient conditions are suggested to reveal one of its optimal solutions without resolution of the problem. Furthermore, some sufficient conditions are then given to determine some components from one of its optimal solutions. Based on these conditions, we can simplify the problem and reduce its dimensions. The simplified problem can be reformulated to an ۰-۱ mixed integer programming problem. Other unknown variables can be found by solving the current problem.

کلیدواژه ها:

Bipolar fuzzy relation equation ، Quadratic programming ، Max-product composition ، mixed integer programming problem

نویسندگان

A. Abbasi Molai

School of Mathematics and Computer Sciences,Damghan University, P.O.Box ۳۶۷۱۵-۳۶۴, Damghan, Iran