A new two-level linear relaxed bound method for geometric programming problems (Q1774846): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:39, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new two-level linear relaxed bound method for geometric programming problems |
scientific article |
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
