A modified convace simplex algorithm for geometric programming

DOI10.1007/BF02665292zbMath0274.90050MaRDI QIDQ2265341

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)

Related Items

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

Cites Work

• Geometric programming with signomials
• Complementary Geometric Programming
• The Convex Simplex Method
• Generalized Polynomial Optimization
• Duality Theory for Geometric Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

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