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

Trace optimization problems and generalized geometric programming

โœ Scribed by C.H Scott; T.R Jefferson

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
177 KB
Volume
58
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Global optimization of generalized geome
Global optimization of generalized geometric programming
โœ Yanjun Wang; Kecun Zhang; Yuelin Gao ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 687 KB

In this paper a deterministic global optimization algorithm is proposed for locating the global minimum of the generalized geometric programming (GGP) problem. By utilizing an exponential variable transformation and some other techniques the initial nonconvex problem (GGP) is reduced to a typical re

Optimality criteria for general unconstr
Optimality criteria for general unconstrained geometric programming problems
โœ Tibor Illรฉs ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 393 KB

This paper presents a possible generalization of geometric programming problems. Such a generalization was proposed by Paterson [6], based on Roc.l~eUar's [8] conjugate function theory. Using their results, we define a slightly different, more symmetric dual pair of general unconstrained geometric

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