An approximate algorithm for global solution of generalized geometric programming

MaRDI QIDQ3501224zbMATH OpenFDO

Authors Hong-Wei Jiao, Qin Ren

Publication date 3 June 2008

zbMATH Keywords

global optimizationlinearization methodgeneralized geometric programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• A global optimization using linear relaxation for generalized geometric programming
• Linearization method of global optimization for generalized geometric programming
• scientific article; zbMATH DE number 2052076
• A robust algorithm for generalized geometric programming
• Global optimization of generalized geometric programming

Cited in

(10)

• A general alternative procedure for solving negative degree of difficulty problems in geometric programming
• A robust algorithm for generalized geometric programming
• scientific article; zbMATH DE number 6311964 (Why is no real title available?)
• Linearization method of global optimization for generalized geometric programming
• scientific article; zbMATH DE number 3916034 (Why is no real title available?)
• A global optimization using linear relaxation for generalized geometric programming
• A phase-1 approach for the generalized simplex algorithm
• Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras
• An efficient global approach for posynomial geometric programming problems
• scientific article; zbMATH DE number 3984992 (Why is no real title available?)

This page was built for publication: An approximate algorithm for global solution of generalized geometric programming

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