A New Global Optimization Algorithm for Solving Generalized Geometric Programming

San-Yang Liu, Chun-Feng Wang and Li-Xia Liu

Mathematical Problems in Engineering, 2010, vol. 2010, 1-12

Abstract:

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.

Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2010/346965.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2010/346965.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:346965

DOI: 10.1155/2010/346965

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().