๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A robust algorithm for generalized geometric programming

โœ Scribed by Peiping Shen; Yuan Ma; Yongqiang Chen

Publisher
Springer US
Year
2008
Tongue
English
Weight
228 KB
Volume
41
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Two problems with GGP generalized geomet
Two problems with GGP generalized geometric programming algorithm
โœ Yeh, Alexander ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 386 KB

The generalized geometric programming algorithm GGP has been found to be one of the better algorithms for optimizing algebraic functions subject to algebraic constraints. The paper discusses two problems with the GGP algorithm presented by Avriel et al. (1980). The first problem is that, because of

A new type of condensation curvilinear p
A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming
โœ Yanjun Wang; Kecun Zhang; Peiping Shen ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 724 KB

new type of condensation curvilinear path algorithm is proposed for unconstrained generalized geometric programming (GGP). First, a new type of condensation problem is presented based on the special structure of GGP. Then a particular curvilinear path for the problem is constructed, along which we g