Constrained maximization of posynomials by geometric programming

DOI10.1007/BF00928296zbMath0177.23201MaRDI QIDQ2533709

L. D. Pacual, Adi Ben-Israel

Publication date: 1970

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

zbMATH Keywords

operations research

Related Items (9)

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

Cites Work

• Unnamed Item
• Linearizing Geometric Programs

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