این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
Iranian Journal of Numerical Analysis and Optimization، جلد ۱۱، شماره ۲، صفحات ۴۰۷-۴۳۵
عنوان فارسی
چکیده فارسی مقاله
کلیدواژه‌های فارسی مقاله
عنوان انگلیسی A new algorithm for solving linear programming problems with bipolar fuzzy relation equation constraints
چکیده انگلیسی مقاله This paper studies the linear optimization problem subject to a system of bipolar fuzzy relation equations with the max-product composition operator. Its feasible domain is briefly characterized by its lower and upper bound, and its consistency is considered. Also, some sufficient conditions are proposed to reduce the size of the search domain of the optimal solution to the problem. Under these conditions, some equations can be deleted to compute the minimum objective value. Some sufficient conditions are then proposed which under them, one of the optimal solutions of the problem is explicitly determined and the uniqueness conditions of the optimal solution are expressed. Moreover, a modified branch-and-bound method based on a value matrix is proposed to solve the reduced problem. A new algorithm is finally designed to solve the problem based on the conditions and modified branch-and-bound method. The algorithm is compared to the methods in other papers to show its efficiency. 
کلیدواژه‌های انگلیسی مقاله Bipolar Fuzzy Relation Equation, Linear Optimization, MaxProduct Composition, Modified Branch-and-Bound Method
نویسندگان مقاله S. Aliannezhadi |
School of Mathematics and Computer Sciences, Damghan University, P.O.Box 36715- 364, Damghan, Iran.

A. Abbasi Molai |
School of Mathematics and Computer Sciences, Damghan University, P.O.Box 36715- 364, Damghan, Iran.

نشانی اینترنتی https://ijnao.um.ac.ir/article_40356_7506fb590e1f5781ba09ed85ce553566.pdf
فایل مقاله فایلی برای مقاله ذخیره نشده است
کد مقاله (doi)
زبان مقاله منتشر شده en
موضوعات مقاله منتشر شده
نوع مقاله منتشر شده
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات