Fuzzy Unconstrained Geometric Programming Problem
Since 1960s, geometric programming (GP) is utilized in different fields (like operations management, engineering science, and so on). Geometric programming (GP) is one of the powerful techniques to solve a specific type of nonlinear programming problem (NLP). The theory of geometric programming (GP) is first introduced in 1961 by Duffin and Zener. The first publication on geometric programming (GP) was published by Duffin and Zener in 1967. There are numerous references to applications and strategies for GP in the survey paper by Ecker. In the standard geometric model, all coefficients are considered as fixed. In real circumstances, it will have some little fluctuations.
- B.Y. Cao, in Solution and Theory of Question for a Kind of Fuzzy Positive Geometric Program. Proceedings of the 2nd IFSA Congress, Tokyo, Japan 1 (1987), pp. 205–208Google Scholar
- N.K. Mandal, T.K. Roy, A displayed inventory model with L-R fuzzy number. Fuzzy Optim. Decis. Mak. 5(3), 227–243 (2006)Google Scholar
- LINGO: The Modeling Language and Optimizer (1999). Lindo system Inc., Chicago, IL 60622, USA Google Scholar
- J.-H. Yang, B.-Y. Cao, in Geometric Programming with Fuzzy Relation Equation Constraints. FUZZ-IEEE (2005), pp. 557–560Google Scholar
- S. Yousef, N. Badra, T.G. Yazied Abu-El, Geometric programming problems with fuzzy parameters and its application to crane load sway. World Appl. Sci. J. 7(1), 94–101 (2009)Google Scholar