Efficient Convexification Strategy for Generalized Geometric Programming Problems

Generalized geometric programming (GGP) problems consist of a signomial being minimized in the objective function subject to signomial constraints, and such problems have been utilized in various f...