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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.