Pages that link to "Item:Q2899141"
From MaRDI portal
The following pages link to An Efficient Global Approach for Posynomial Geometric Programming Problems (Q2899141):
Displaying 9 items.
- Global optimization of signomial geometric programming problems (Q296971) (← links)
- A reformulation framework for global optimization (Q367160) (← links)
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← 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)
- Branch-reduction-bound algorithm for generalized geometric programming (Q2392111) (← 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)
