An Efficient Global Approach for Posynomial Geometric Programming Problems

DOI10.1287/ijoc.1100.0403zbMath1243.90181MaRDI 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 optimization; piecewise linear function; signomial geometric programming; posynomial geometric programming; convex underestimation

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming

Related Items

Finding all global optima of engineering design problems with discrete signomial terms, Efficient Convexification Strategy for Generalized Geometric Programming Problems, Global optimization of signomial geometric programming problems, 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, Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms, Branch-reduction-bound algorithm for generalized geometric programming