Pages that link to "Item:Q879567"
From MaRDI portal
The following pages link to A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation (Q879567):
Displaying 11 items.
- Range division and contraction algorithm for a class of global optimization problems (Q279507) (← links)
- Global optimization of signomial geometric programming problems (Q296971) (← links)
- A continuous strategy to solve a class of mixed optimization problems (Q496673) (← links)
- The discrete ellipsoid covering problem: a discrete geometric programming approach (Q496677) (← links)
- Signomial and polynomial optimization via relative entropy and partial dualization (Q823883) (← links)
- A robust algorithm for generalized geometric programming (Q934812) (← links)
- A global optimization algorithm for signomial geometric programming problem (Q1722230) (← links)
- Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach (Q2282675) (← links)
- Branch-reduction-bound algorithm for generalized geometric programming (Q2392111) (← links)
- Accelerating method of global optimization for signomial geometric programming (Q2479370) (← links)
- A Continuous Strategy to Solve a Class of Discrete Optimization Problems (Q2883574) (← links)
