A New Method for Solving Fully Fuzzy Monomial Geometric Programming with Trapezoidal Fuzzy Parameters

Abstract

Geometric Programming (GP) problem is very considered problem in many fields these days. In the literature, many studies have been focusing on the different types of GP. Many methods were proposed and developed during these years to find the optimal solution easier. In this paper, we propose a method to solve one type of geometric programming so called Monomial Geometric Programming problem respect to Trapezoidal Fuzzy Numbers (MGPTFN). We try to keep the fuzzy numbers in the fuzzy form during the whole solution and use negative fuzzy numbers in the problem. We want to show that in this type of Fuzzy Geometric Programming problem (FGP), for the problem with negative coefficients or exponents, optimal solution and optimal value can be computed and for multi-objective geometric programming problem or GP with polynomial objective function, this method holds. For illustrate the method we use numerical examples.