Abstract
In this paper, the mixed fuzzy relation geometric programming problem is considered. The Mixed Fuzzy Relation Inequality (MFRI) system is an importance extension of FRI. It is shown that its feasible domain is non-convex and completely determined by its maximum solution and all its minimal solutions. A combination of the components of maximum solution and one of the minimal solutions solves the optimization problem. Some simplification procedures are proposed to solve the problem. An algorithm is finally designed to solve the problem.