✦ LIBER ✦

On subsidiary problems in geometric programming

✍ Scribed by Jayant Rajgopal; Dennis L. Bricker

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 760 KB
Volume: 63
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(92)90058-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Non-linear subsidiary problems in mathem

Non-linear subsidiary problems in mathematical programming

✍ E.I. Volynskii; M.Z. Khenkin 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 385 KB

Solution to geometric programming proble

Solution to geometric programming problems by transformation to convex programming problems

✍ G.S. Dawkins; B.C. McInnis; S.K. Moonat 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 144 KB

On geometric programming problems having

On geometric programming problems having negative degrees of difficulty

✍ Dennis L. Bricker; Jae Chul Choi; Jayant Rajgopal 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Trace optimization problems and generali

Trace optimization problems and generalized geometric programming

✍ C.H Scott; T.R Jefferson 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 177 KB

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

Geometric programming problems with nega

Geometric programming problems with negative degrees of difficulty

✍ S.B. Sinha; A. Biswas; M.P. Biswal 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 207 KB