A new linearization method for posynomial constrained generalized geometric programming

DOI10.3969/J.ISSN.1671-6841.2015.01.005MaRDI QIDQ3196009zbMATH OpenFDO

Authors Xuefeng Han, B. Yang

Publication date 28 October 2015

Full work available at URL https://doi.org/10.3969/J.ISSN.1671-6841.2015.01.005

zbMATH Keywords

convex programminggeneralized geometric programmingposynomialoptimization solution

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Recommendations

• Linearization method of global optimization for generalized geometric programming
• A new linear relaxed method for solving generalized geometric programming
• Linear Programming Approach to Solve Geometric Programming Problem
• Publication:3200893
• A new algorithm for geometric programming based on the linear structure of its dual problem.

Cited in

(11)

• scientific article; zbMATH DE number 4176845 (Why is no real title available?)
• Linear Programming Approach to Solve Geometric Programming Problem
• Posynomial geometric programming as a special case of semi-infinite linear programming
• Modified geometric programming problem and its applications
• scientific article; zbMATH DE number 4043632 (Why is no real title available?)
• A MILP formulation for generalized geometric programming using piecewise-linear approximations
• An interior-conjugate gradient mix-method for positive geometric programming
• A new two-level linear relaxed bound method for geometric programming problems
• Generalized gradient projection interior point algorithm for geometric programming
• A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming
• Solving posynomial geometric programming problems via generalized linear programming

This page was built for publication: A new linearization method for posynomial constrained generalized geometric programming

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