Treating free variables in generalized geometric global optimization programs
From MaRDI portal
Recommendations
- On generalized geometric programming problems with non-positive variables
- Global optimization for generalized geometric programs with mixed free-sign variables
- Global optimization for generalized geometric programming with free variables
- Engineering design by geometric programming
- A global optimization using linear relaxation for generalized geometric programming
Cited in
(13)- Efficient Convexification Strategy for Generalized Geometric Programming Problems
- A review of recent advances in global optimization
- A MILP formulation for generalized geometric programming using piecewise-linear approximations
- On generalized geometric programming problems with non-positive variables
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems
- Global optimization for generalized geometric programs with mixed free-sign variables
- Convexity of products of univariate functions and convexification transformations for geometric programming
- A review of deterministic optimization methods in engineering and management
- Solving geometric programming problems with normal, linear and zigzag uncertainty distributions
- An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming
- An efficient convexification method for solving generalized geometric problems
- Convex underestimation for posynomial functions of positive variables
This page was built for publication: Treating free variables in generalized geometric global optimization programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q811884)
