Linear Programming Approach to Solve Geometric Programming Problem

DOI10.1080/02522667.1989.10698959MaRDI QIDQ3832328zbMATH OpenOpenAlexFDO

Authors

Publication date 1989

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1989.10698959

zbMATH Keywords

ellipsoid algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Nonlinear programming (90C30) Mathematical programming (90C99)

Recommendations

• Publication:3200893
• scientific article; zbMATH DE number 3883959
• A new linearization method for posynomial constrained generalized geometric programming
• A new algorithm for geometric programming based on the linear structure of its dual problem.
• New geometric programming algorithms with numerical experiments

Cites work

• An Easy Primal Method for Geometric Programming
• An ellipsoid algorithm for nonlinear programming
• Feature Article—The Ellipsoid Method: A Survey
• Linearizing Geometric Programs

Cited in

(7)

• New geometric programming algorithms with numerical experiments
• A new linearization method for posynomial constrained generalized geometric programming
• scientific article; zbMATH DE number 4176845 (Why is no real title available?)
• scientific article; zbMATH DE number 3883959 (Why is no real title available?)
• scientific article; zbMATH DE number 4043632 (Why is no real title available?)
• scientific article; zbMATH DE number 1301965 (Why is no real title available?)
• Solving posynomial geometric programming problems via generalized linear programming

This page was built for publication: Linear Programming Approach to Solve Geometric Programming Problem

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