✦ LIBER ✦

New geometric programming algorithms with numerical experiments

✍ Scribed by A.V. Pokatayev

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 657 KB
Volume: 24
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(86)90041-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Numerical experiments in a new class of

Numerical experiments in a new class of algorithms in linear programming

✍ S.K. Andrusenko; E.A. Nurminskii; P.I. Stetsyuk 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 461 KB

Numerical experiments with MG continuati

Numerical experiments with MG continuation algorithms

✍ Gh. Juncu; E. Mosekilde; C. Popa 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Experiments with dynamic programming alg

Experiments with dynamic programming algorithms for nonseparable problems

✍ Alleli Domingo; Moshe Sniedovich 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 870 KB

Numerical experiences with graph colorin

Numerical experiences with graph coloring algorithms

✍ Jürgen Peemöller 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 426 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

Numerical experiments with one-dimension

Numerical experiments with one-dimensional adaptive cubic algorithm

✍ André Ferrari; Efim A. Galperin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 433 KB