A new global optimization algorithm for solving generalized geometric programming (Q624692)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new global optimization algorithm for solving generalized geometric programming |
scientific article; zbMATH DE number 5849029
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new global optimization algorithm for solving generalized geometric programming |
scientific article; zbMATH DE number 5849029 |
Statements
A new global optimization algorithm for solving generalized geometric programming (English)
0 references
9 February 2011
0 references
Summary: A global optimization algorithm for solving generalized geometric programming (GGP) problem is developed based on a new linearization technique. Furthermore, in order to improve the convergence speed of this algorithm, a new pruning technique is proposed, which can be used to cut away a large part of the current investigated region in which the global optimal solution does not exist. Convergence of this algorithm is proved, and some experiments are reported to show the feasibility of the proposed algorithm.
0 references
0 references
