Efficient Convexification Strategy for Generalized Geometric Programming Problems

Hao-Chun Lu () and Liming Yao ()
Additional contact information
Hao-Chun Lu: Department of Information Management, Fu Jen Catholic University, Xinzhuang, New Taipei City, 24205 Taiwan
Liming Yao: Business School, Sichuan University, 610065 Chengdu, China

INFORMS Journal on Computing, 2019, vol. 31, issue 2, 226-234

Abstract: 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 fields. After modeling numerous applications as GGP problems, solving them has become a significant requirement. A convex underestimator is considered an important concept to solve GGP problems for obtaining the global minimum. Among convex underestimators, variable transformation is one of the most popular techniques. This study utilizes an estimator to solve the difficulty of selecting an appropriate transformation between the exponential transformation and power convex transformation techniques and considers all popular types of transformation techniques to develop a novel and efficient convexification strategy for solving GGP problems. This proposed convexification strategy offers a guide for selecting the most appropriate transformation techniques on any condition of a signomial term to obtain the tightest convex underestimator. Several numerical examples in the online supplement are presented to investigate the effects of different convexification strategies on GGP problems and demonstrate the effectiveness of the proposed convexification strategy with regard to both solution quality and computation efficiency.

Keywords: convex programming; generalized geometric programming; convexification strategy; variables transformation technique; global optimization (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1287/ijoc.2018.0850 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:31:y:2019:i:2:p:226-234

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().