On the computational utility of posynomial geometric programming solution methods
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3694049 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- 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
- Current state of the art of algorithms and computer software for geometric programming
- Dual to primal conversion in geometric programming
Cited in
(7)- Fuzzy Performance Evaluation of Nonlinear Optimization Methods, with Sensitivity Analysis of the Final Scores
- Performance evaluation of nonlinear optimization methods via pairwise comparison and fuzzy numbers
- On geometric programming and complementary slackness
- Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras
- 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
- Convexification of nonsmooth monotone functions
This page was built for publication: On the computational utility of posynomial geometric programming solution methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3929559)
