scientific article; zbMATH DE number 2052076

zbMATH Open1043.65077MaRDI QIDQ4454073FDOQ4454073

Peiping Shen, Kecun Zhang

Publication date: 7 March 2004

Title of this publication is not available (Why is that?)

Recommendations

• A new linear relaxed method for solving generalized geometric programming
• Linearization method of global optimization for generalized geometric programming
• Global optimization of generalized geometric programming
• Algorithm of global optimization for generalized geometric programming
• A deterministic global optimization algorithm for generalized geometric programming

zbMATH Keywords

convergenceglobal optimizationnumerical exampleslinearization methodbranch and bound algorithmgeneralized geometric programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Cited In (8)

• Algorithm of global optimization for generalized geometric programming
• An approximate algorithm for global solution of generalized geometric programming
• A new two-level linear relaxed bound method for geometric programming problems
• Global optimization of generalized geometric programming
• Linearization method of global optimization for generalized geometric programming
• A global optimization using linear relaxation for generalized geometric programming
• An efficient global approach for posynomial geometric programming problems
• A deterministic global optimization algorithm for generalized geometric programming

This page was built for publication:

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