A MILP formulation for generalized geometric programming using piecewise-linear approximations
Authors:
- Chung-Li TsengCTChung-Li Tseng
- Yiduo ZhanYZYiduo Zhan
- Qipeng P. ZhengQZQipeng P. Zheng
- Manish KumarMKManish Kumar
- 1 September 2015
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 245 (2) , 360-370
Abstract
No abstract availableThis publication has 32 references indexed in Scilit:
- MM algorithms for geometric and signomial programmingMathematical Programming, 2012
- Global Optimization for Generalized Geometric Programs with Mixed Free-Sign VariablesOperations Research, 2009
- Computational Comparison of Piecewise−Linear Relaxations for Pooling ProblemsIndustrial & Engineering Chemistry Research, 2009
- Treating Free Variables in Generalized Geometric Global Optimization ProgramsJournal of Global Optimization, 2005
- Some convexifications in global optimization of problems containing signomial termsComputers & Chemical Engineering, 2003
- Optimal objective function approximation for separable convex quadratic programmingMathematical Programming, 1994
- Objective function approximations in mathematical programmingMathematical Programming, 1977
- A set of geometric programming test problems and their solutionsMathematical Programming, 1976
- A modified concave simplex algorithm for geometric programmingJournal of Optimization Theory and Applications, 1975
- An extension of geometric programming with applications in engineering optimizationJournal of Engineering Mathematics, 1971