A modified convace simplex algorithm for geometric programming

DOI10.1007/BF02665292MaRDI QIDQ2265341zbMATHFDO

Authors P. A. Beck, J. G. Ecker

Publication date 1975

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

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Cites work

• scientific article; zbMATH DE number 3272827 (Why is no real title available?)
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• scientific article; zbMATH DE number 3390558 (Why is no real title available?)
• Complementary Geometric Programming
• Duality Theory for Geometric Programming
• Generalized Polynomial Optimization
• Geometric programming with signomials
• The Convex Simplex Method

Cited in

(5)

• On subsidiary problems in geometric programming
• A set of geometric programming test problems and their solutions
• A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
• A MILP formulation for generalized geometric programming using piecewise-linear approximations
• Computational aspects of cutting-plane algorithms for geometric programming problems

This page was built for publication: A modified convace simplex algorithm for geometric programming

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