Pages that link to "Item:Q924639"
From MaRDI portal
The following pages link to Global solution of optimization problems with signomial parts (Q924639):
Displaying 17 items.
- Global optimization of signomial geometric programming problems (Q296971) (← links)
- A reformulation framework for global optimization (Q367160) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← links)
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables (Q1024826) (← links)
- Some transformation techniques with applications in global optimization (Q1029684) (← links)
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems (Q1941031) (← links)
- Optimal incentive pricing on relaying services for maximizing connection availability in multihop cellular networks (Q1954655) (← links)
- A review of deterministic optimization methods in engineering and management (Q1955154) (← links)
- Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms (Q2164609) (← links)
- An efficient convexification method for solving generalized geometric problems (Q2358874) (← links)
- Branch-reduction-bound algorithm for generalized geometric programming (Q2392111) (← links)
- Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms (Q2397434) (← links)
- Convex underestimation strategies for signomial functions (Q3396383) (← links)
- Finding all global optima of engineering design problems with discrete signomial terms (Q5059294) (← links)
- Efficient Convexification Strategy for Generalized Geometric Programming Problems (Q5138255) (← links)
- A global interior point method for nonconvex geometric programming (Q6572703) (← links)