A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty

DOI10.1007/s10589-007-9148-3zbMath1208.90163OpenAlexW2002951928MaRDI QIDQ849071

Wang Yanjun, Liang Zhian, Li Tao

Publication date: 24 February 2010

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

Full work available at URL: https://doi.org/10.1007/s10589-007-9148-3

zbMATH Keywords

decomposition method

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (4)

Branch-reduction-bound algorithm for generalized geometric programming ⋮ A framework for globally optimizing mixed-integer signomial programs ⋮ A global optimization algorithm for signomial geometric programming problem ⋮ Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric programming problems with negative degrees of difficulty
• Generalized geometric programming applied to problems of optimal control. I: Theory
• On geometric programming problems having negative degrees of difficulty
• An infeasible interior-point algorithm for solving primal and dual geometric programs
• A general alternative procedure for solving negative degree of difficulty problems in geometric programming
• Modified geometric programming problem and its applications
• Global optimization of generalized geometric programming
• Geometric programming with signomials
• Geometric Programming: Methods, Computations and Applications
• Duality Theory for Geometric Programming

This page was built for publication: A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty