Pages that link to "Item:Q1597169"
From MaRDI portal
The following pages link to A new algorithm for geometric programming based on the linear structure of its dual problem. (Q1597169):
Displaying 10 items.
- A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems (Q799488) (← links)
- A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty (Q849071) (← links)
- An alternative approach to the refined duality theory of geometric programming (Q1197451) (← links)
- Investigation of path-following algorithms for signomial geometric programming problems (Q1280139) (← links)
- A new two-level linear relaxed bound method for geometric programming problems (Q1774846) (← links)
- An update on bi-level geometric programming: A new optimization model (Q1801971) (← links)
- Posynomial geometric programming as a special case of semi-infinite linear programming (Q1824566) (← links)
- Using geometric arithmetic mean to solve non-linear fractional programming problems (Q2170967) (← links)
- Infeasible interior-point algorithm based optimization method for geometric programming (Q2704889) (← links)
- A new linearization method for posynomial constrained generalized geometric programming (Q3196009) (← links)