On the computational utility of posynomial geometric programming solution methods

DOI10.1007/BF01581036zbMath0473.90074MaRDI QIDQ3929559

J. E. Fattler, Gintaras V. Reklaitis, R. R. Root, Y. T. Sin, K. M. Ragsdell

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

comparison of algorithmsnumerical studyrandom test problemsposynomial geometric programmingnumerical testingcode comparisonscomputational utility

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Mathematical programming (90C99)

Related Items (7)

Performance evaluation of nonlinear optimization methods via pairwise comparison and fuzzy numbers ⋮ Convexification of nonsmooth monotone functions ⋮ Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras ⋮ Fuzzy Performance Evaluation of Nonlinear Optimization Methods, with Sensitivity Analysis of the Final Scores ⋮ Comparison of a special-purpose algorithm with general-purpose algorithms for solving geometric programming problems ⋮ On the convexification of nonlinear programming problems: An applications-oriented survey ⋮ On geometric programming and complementary slackness

Cites Work

• Unnamed Item
• Unnamed Item
• Current state of the art of algorithms and computer software for geometric programming
• Dual to primal conversion in geometric programming
• A comparison of computational strategies for geometric programs
• A condensation method for generalized geometric programming
• Computational aspects of cutting-plane algorithms for geometric programming problems

This page was built for publication: On the computational utility of posynomial geometric programming solution methods