A computational study of methods for solving polynomial geometric programs

DOI10.1007/BF00934095zbMath0307.49038OpenAlexW2091021473MaRDI QIDQ1218172

John J. Dinkel, Gary A. Kochenberger, Bruce A. McCarl

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1007/bf00934095

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Controllability, observability, and system structure (93B99) Numerical methods in optimal control (49M99)

Related Items

Current state of the art of algorithms and computer software for geometric programming, An approach to the numerical solutions of geometric programs

Cites Work

• Constrained maximization of posynomials by geometric programming
• Geometric programming with signomials
• Sequential Search: A Method for Solving Constrained Optimization Problems
• Generalized Polynomial Optimization
• Condensing generalized polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item