Monomial geometric programming with bipolar max-product constraints

In the real-world, monomials are widely used. In the process of optimization, many objective functions can be denoted by monomials. In this paper, we present a fuzzy relation geometric programming model with a monomial objective function subject to the fuzzy relational equality constraints by allowing for bipolar max-product constraints. A necessary condition is given for feasibility of the constraints of the problem. If the feasible domain is not empty, then it can algebraically be determined. An algorithm is designed to find all optimal solutions of the problems.

Keywords:

Bipolar constraints , Fuzzy relation equation , Fuzzy relation geometric programming , Max-product constraints , Monomial optimization