Monomial geometric programming with an arbitrary fuzzy relational inequality

In this paper, an optimization model with geometric objective function is presented. Geometric programming is widely used; many objective functions in optimization problems can be analyzed by geometric programming. We often encounter these in resource allocation and structure optimization and technology management, etc. On the other hand, fuzzy relation equalities and inequalities are also used in many areas. We here present a geometric programming model with a monomial objective function subject to the fuzzy relation inequality constraints with an arbitrary function. The feasible solution set is determined and compared with some common results in the literature. A necessary and sufficient condition and three other necessary conditions are presented to conceptualize the feasibility of the problem. In general a lower bound is always attainable for the optimal objective value by removing the components having no effect on the solution process. By separating problem to non-decreasing and non-increasing function to prove the optimal solution, we simplify operations to accelerate the resolution of the problem