A deterministic global optimization algorithm for generalized geometric programming
Publication:2572718
DOI10.1016/J.AMC.2005.01.142zbMath1105.65335OpenAlexW2044056253MaRDI QIDQ2572718
Publication date: 4 November 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.01.142
algorithmglobal optimizationreverse convex programmingrobust stabilitynumerical experimentgeometric programmingbranch and bound methodcutting-plane method
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items (28)
Cites Work
- Unnamed Item
- A stochastic geometric programming problem with multiplicative recourse
- Generalized geometric programming applied to problems of optimal control. I: Theory
- Restricted multinomial maximum likelihood estimation based upon Fenchel duality
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- Prediction of oligopeptide conformations via deterministic global optimization
- Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach
- Geometric programming with signomials
- Effectiveness of a geometric programming algorithm for optimization of machining economics models
- Allocation of resources in project management
- Generalized Polynomial Optimization
- Generalized Weighted Mean Programming
This page was built for publication: A deterministic global optimization algorithm for generalized geometric programming