A modified convace simplex algorithm for geometric programming

DOI10.1007/BF02665292zbMATH Open0274.90050MaRDI QIDQ2265341FDOQ2265341

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

• Title not available (Why is that?)
• Geometric programming with signomials
• Generalized Polynomial Optimization
• Duality Theory for Geometric Programming
• Complementary Geometric Programming
• Title not available (Why is that?)
• The Convex Simplex Method
• Title not available (Why is that?)

Cited In (5)

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

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)