Branch-reduction-bound algorithm for generalized geometric programming
Authors:
- 13 June 2012
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 56 (3) , 1123-1142
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Convex underestimation strategies for signomial functionsOptimization Methods and Software, 2009
- A global optimization using linear relaxation for generalized geometric programmingEuropean Journal of Operational Research, 2008
- Global solution of optimization problems with signomial partsDiscrete Optimization, 2008
- A general algorithm for solving Generalized Geometric Programming with nonpositive degree of difficultyComputational Optimization and Applications, 2007
- A new rectangle branch-and-pruning approach for generalized geometric programmingApplied Mathematics and Computation, 2006
- Global optimization in generalized geometric programmingComputers & Chemical Engineering, 1997
- Effectiveness of a geometric programming algorithm for optimization of machining economics modelsComputers & Operations Research, 1996
- Restricted multinomial maximum likelihood estimation based upon Fenchel dualityStatistics & Probability Letters, 1994
- A stochastic geometric programming problem with multiplicative recourseOperations Research Letters, 1990
- Analysis and optimization of the Williams‐Otto process by geometric programmingAIChE Journal, 1974