Monomial geometric programming problem with bipolar fuzzy relation equation constraints

In this paper, a monomial geometric programing problem subject to a system of bipolar fuzzy relation equations with the max-product composition is studied. First of all, the structure of its feasible domain is investigated. Moreover, some useful properties of its optimal solutions are expressed. Then, the problem is converted to an ۰-۱ integer programming problem based on the properties. We can apply its techniques to find the optimal solution of the original problem.

Keywords:

Monomial geometric programming , Bipolar fuzzy relation equation , max-product composition , Integer programming , Optimal solution.