Solving a Posynomial Geometric Programming Problem with Fully Fuzzy Approach

Abstract

Abstract. In this paper we have investigated a class of geometric programming problems in which all the parameters are fuzzy numbers, therefore we expect that the final value of objective function should be fuzzy aswell.On transforming the primal problem of fuzzy geometric programming into it’s dual and on using the Zadeh’s extension principle we convert the dual form into a pair of mathematical program. By taking the α-cut on objective function and r-cut on constraints in dual form of geometric programming, we obtain an acceptable (α; r) optimal values. Then we further calculate the lower and upper bounds of the fuzzy objective with emphasize on modification of the method presented in [14, 26]. In the end we illustrate the methodology of the approach with a numerical example to clear the idea by drawing the membership function graph of the fuzzy objective .