A new two-level linear relaxed bound method for geometric programming problems (Q1774846)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new two-level linear relaxed bound method for geometric programming problems |
scientific article; zbMATH DE number 2165263
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new two-level linear relaxed bound method for geometric programming problems |
scientific article; zbMATH DE number 2165263 |
Statements
A new two-level linear relaxed bound method for geometric programming problems (English)
0 references
4 May 2005
0 references
Geometric programming
0 references
Algorithm
0 references
Global optimization
0 references
Linearization technique
0 references
Branch-and-bound method
0 references
Relaxed approximation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8965099
0 references
0.8887373
0 references
0.8832955
0 references
0.8729633
0 references
