Constrained maximization of posynomials by geometric programming

DOI10.1007/BF00928296MaRDI QIDQ2533709zbMATH OpenFDO

Authors L. D. Pacual, Adi Ben-Israel

Publication date 1970

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00928296

zbMATH Keywords

operations research

Cites work

• scientific article; zbMATH DE number 3272827 (Why is no real title available?)
• Linearizing Geometric Programs

Cited in

(9)

• A computational study of methods for solving polynomial geometric programs
• Maximization of linearly constrained posynomials
• Investigation of path-following algorithms for signomial geometric programming problems
• Robust budget allocation via continuous submodular functions
• An efficient convexification method for solving generalized geometric problems
• On the solution of maximization problems of optimal design by geometric programming
• Geometric programming with signomials
• An alternative linearization technique
• An iterative convex simplex method for geometric programming with applications†

This page was built for publication: Constrained maximization of posynomials by geometric programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2533709)