A new linear relaxed method for solving generalized geometric programming
From MaRDI portal
Publication:3570925
zbMATH Open1212.90311MaRDI QIDQ3570925FDOQ3570925
Authors: Chunfeng Wang, Peiping Shen 
Publication date: 8 July 2010
Recommendations
- scientific article; zbMATH DE number 2052076
- A deterministic global optimization algorithm for generalized geometric programming
- A new global optimization algorithm for solving generalized geometric programming
- Algorithm of global optimization for generalized geometric programming
- Linearization method of global optimization for generalized geometric programming
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cited In (10)
- Title not available (Why is that?)
- Algorithm of global optimization for generalized geometric programming
- A new linearization method for posynomial constrained generalized geometric programming
- Solving generalized polynomial problem by using new affine relaxed technique
- A new two-level linear relaxed bound method for geometric programming problems
- Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model
- A linearized relaxing algorithm for the specific nonlinear optimization problem
- A global optimization using linear relaxation for generalized geometric programming
- A new global optimization algorithm for solving generalized geometric programming
- A deterministic global optimization algorithm for generalized geometric programming
This page was built for publication: A new linear relaxed method for solving generalized geometric programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3570925)
