.png){kind=icon}
Return
Linearization method of global optimization for generalized geometric programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2003.12.101.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many methods for solving generalized geometric programming (GGP) problem can only find locally optimal solutions. But up to now, less work has been devoted to solving global optimization of GGP due to the inherent difficulty. This paper gives a method for finding the globally optimal solutions of GGP. Utilizing an exponentially variable transformation and some other techniques the initial nonlinear and nonconvex GGP problem is reduced to a sequence of linear programming problems. The proposed algorithm is proven that it is convergent to the global minimum through the solutions of a series of linear programming problems. Several GGP examples in the literatures are tested to demonstrate that the proposed method can systematically solve these examples to find the global optimum within a prespecified error. (C) 2004 Elsevier Inc. All rights reserved.
Keywords:
generalized geometric programming
global optimization
linearization
branch-and-bound
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
ShareSaveShareSaveShareSave
View more