The geometric programming problem provided to fuzzy relation inequality constraints

In this paper, the geometric programming problem subject to Fuzzy Relation Inequality (FRI) constraints is considered. We firstly study the structure of its feasible domain. The feasible solution set is completely determined by a maximum solution and a finite number of minimal or quasi-minimal solutions. Then the problem is converted to two sub-problems. The maximum solution and one of the minimal solutions solve two sub-problems. Combining two solutions, we can find the optimal solution of the original problem.

Keywords:

Fuzzy relation inequality , geometric programming , max-product composition , minimal solution