Pages that link to "Item:Q2479370"
From MaRDI portal
The following pages link to Accelerating method of global optimization for signomial geometric programming (Q2479370):
Displaying 12 items.
- Global optimization of signomial geometric programming problems (Q296971) (← links)
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation (Q879567) (← links)
- Global optimization of signomial geometric programming using linear relaxation. (Q1428180) (← links)
- An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming (Q1704917) (← links)
- A global optimization algorithm for signomial geometric programming problem (Q1722230) (← links)
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems (Q1941031) (← links)
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
- An effective global optimization algorithm for quadratic programs with quadratic constraints (Q2335092) (← links)
- A nonisolated optimal solution for special reverse convex programming problems (Q2519714) (← links)
- Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
- (Q5425096) (← links)
- Two-level linear relaxation method for generalized linear fractional programming (Q6047583) (← links)