Pages that link to "Item:Q2533709"
From MaRDI portal
The following pages link to Constrained maximization of posynomials by geometric programming (Q2533709):
Displaying 9 items.
- A computational study of methods for solving polynomial geometric programs (Q1218172) (← links)
- Maximization of linearly constrained posynomials (Q1245683) (← links)
- Investigation of path-following algorithms for signomial geometric programming problems (Q1280139) (← links)
- Robust budget allocation via continuous submodular functions (Q2019911) (← links)
- An efficient convexification method for solving generalized geometric problems (Q2358874) (← links)
- On the solution of maximization problems of optimal design by geometric programming (Q2548081) (← links)
- Geometric programming with signomials (Q2553387) (← links)
- An alternative linearization technique (Q2721500) (← links)
- An iterative convex simplex method for geometric programming with applications† (Q4140746) (← links)