A new global optimization algorithm for solving generalized geometric programming

DOI10.1155/2010/346965zbMath1204.90102OpenAlexW2063713789WikidataQ58653026 ScholiaQ58653026MaRDI QIDQ624692

Chun-Feng Wang, Li-Xia Liu, San-Yang Liu

Publication date: 9 February 2011

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/224155

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites Work

• An infeasible interior-point algorithm for solving primal and dual geometric programs
• Global optimization of signomial geometric programming using linear relaxation.
• Linearization method of global optimization for generalized geometric programming
• Global optimization of generalized geometric programming
• A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming
• The expansion of functions under transformation and its application to optimization
• Unnamed Item
• Unnamed Item

This page was built for publication: A new global optimization algorithm for solving generalized geometric programming