A new linearization method for posynomial constrained generalized geometric programming
From MaRDI portal
Recommendations
- Linearization method of global optimization for generalized geometric programming
- A new linear relaxed method for solving generalized geometric programming
- Linear Programming Approach to Solve Geometric Programming Problem
- Publication:3200893
- A new algorithm for geometric programming based on the linear structure of its dual problem.
Cited in
(12)- Modified geometric programming problem and its applications
- A new two-level linear relaxed bound method for geometric programming problems
- Posynomial geometric programming as a special case of semi-infinite linear programming
- A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming
- A MILP formulation for generalized geometric programming using piecewise-linear approximations
- scientific article; zbMATH DE number 4176845 (Why is no real title available?)
- An interior-conjugate gradient mix-method for positive geometric programming
- Generalized gradient projection interior point algorithm for geometric programming
- scientific article; zbMATH DE number 4043632 (Why is no real title available?)
- Linear Programming Approach to Solve Geometric Programming Problem
- scientific article; zbMATH DE number 934402 (Why is no real title available?)
- Solving posynomial geometric programming problems via generalized linear programming
This page was built for publication: A new linearization method for posynomial constrained generalized geometric programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196009)
