Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables
Authors:
- 1 June 2009
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 57 (3) , 701-713
Abstract
Many optimization problems are formulated as generalized geometric programming (GGP) containing signomial terms f(X)·g(Y), where X and Y are continuous and discrete free-sign vectors, respectively. By effectively convexifying f(X) and linearizing g(Y), this study globally solves a GGP with a lower number of binary variables than are used in current GGP methods. Numerical experiments demonstrate the computational efficiency of the proposed method.Keywords
This publication has 16 references indexed in Scilit:
- Digital Circuit Optimization via Geometric ProgrammingOperations Research, 2005
- A Geometric Programming Framework for Univariate Cubic L 1 Smoothing SplinesAnnals of Operations Research, 2005
- Generalized Geometric Programming : Theory2000
- Generalized Geometric Programming Problems1999
- Global Optimization1996
- Optimal design of a dry-type natural-draft cooling tower by geometric programmingJournal of Optimization Theory and Applications, 1978
- A modified concave simplex algorithm for geometric programmingJournal of Optimization Theory and Applications, 1975
- Minimization of Capital Investment for Batch ProcessesIndustrial & Engineering Chemistry Process Design and Development, 1971
- Linearizing Geometric ProgramsSIAM Review, 1970
- Duality Theory for Geometric ProgrammingSIAM Journal on Applied Mathematics, 1966