Separable programming problems with the max-product fuzzy relation equation constraints

In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The detection of the optimal solution of the second subproblem by finding all the minimal solutions will be very time-consuming because of its NP-hardness. To overcome such difficulty, two types of sufficient conditions are proposed to find some of its optimal components or all of them. Under the first type sufficient conditions, some procedures are given to simplify the original problem. Also, a value matrix is defined and an algorithm is proposed to compute an initial upper bound on its optimal objective value using the matrix. Then, a branch-and-bound method is extended using the matrix and initial upper bound to solve the simplified problem without finding all the minimal solutions. 

کلیدواژه ها:

Separable programming problem ، Fuzzy relation equations ، Max-product composition ، Fuzzy optimization