An iterative convex simplex method for geometric programming with applications†

DOI10.1080/00207727708942022zbMath0365.90103OpenAlexW1976462882MaRDI QIDQ4140746

Jati K. Sengupta

Publication date: 1977

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207727708942022

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90)

Cites Work

• On a decomposition for a special class of geometric programming problems
• Constrained maximization of posynomials by geometric programming
• Complementary Geometric Programming
• Generalized Polynomial Optimization
• Unnamed Item
• Unnamed Item

This page was built for publication: An iterative convex simplex method for geometric programming with applications†