A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation (Q879567)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5152400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation |
scientific article; zbMATH DE number 5152400 |
Statements
A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation (English)
0 references
14 May 2007
0 references
signomial geometric programming
0 references
Lagrangian duality
0 references
branch-and-bound algorithm
0 references
mathematical programming
0 references
nonconvex programming
0 references
0 references
0 references
0 references
0 references
0.8839970231056213
0 references
0.8596065640449524
0 references
0.8153308629989624
0 references
0.8089780211448669
0 references
