An Efficient Global Approach for Posynomial Geometric Programming Problems

DOI10.1287/ijoc.1100.0403zbMath1243.90181OpenAlexW2125221547MaRDI QIDQ2899141

Jung-Fa Tsai, Ming-Hua Lin

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1100.0403

zbMATH Keywords

global optimizationpiecewise linear functionsignomial geometric programmingposynomial geometric programmingconvex underestimation

Mathematics Subject Classification ID

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

Related Items (9)

Global optimization of signomial geometric programming problems ⋮ Finding all global optima of engineering design problems with discrete signomial terms ⋮ Branch-reduction-bound algorithm for generalized geometric programming ⋮ Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms ⋮ A reformulation framework for global optimization ⋮ Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems ⋮ Optimal incentive pricing on relaying services for maximizing connection availability in multihop cellular networks ⋮ A review of deterministic optimization methods in engineering and management ⋮ Efficient Convexification Strategy for Generalized Geometric Programming Problems

This page was built for publication: An Efficient Global Approach for Posynomial Geometric Programming Problems