Bipolar Fuzzy Relation Programming Problem with a Geometric Objective Function

An optimization problem with a geometric function provided to a system of bipolar fuzzy relation equations (BFREs) is presented. In this paper, its feasible domain is firstly characterized and then a lower and upper bound on its feasible solution set is determined. Some conditions are presented to check its feasibility. A value matrix is proposed using a useful property of the problem and the branch and bound approach is applied to solve the problem based on the matrix.

کلیدواژه ها:

Bipolar fuzzy relation programming ، Branch and bound approach ، Geometric programming ، max-product operator.