An iterative convex simplex method for geometric programming with applications†

DOI10.1080/00207727708942022MaRDI QIDQ4140746zbMATH OpenOpenAlexFDO

Authors J. K. Sengupta

Publication date 1977

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (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

• Complementary Geometric Programming
• Constrained maximization of posynomials by geometric programming
• Generalized Polynomial Optimization
• scientific article; zbMATH DE number 3380394 (Why is no real title available?)
• scientific article; zbMATH DE number 3414075 (Why is no real title available?)
• On a decomposition for a special class of geometric programming problems

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

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