Reversed geometric programming: A branch-and-bound method involving linear subproblems (Q1141082)
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: Reversed geometric programming: A branch-and-bound method involving linear subproblems |
scientific article; zbMATH DE number 3681515
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reversed geometric programming: A branch-and-bound method involving linear subproblems |
scientific article; zbMATH DE number 3681515 |
Statements
Reversed geometric programming: A branch-and-bound method involving linear subproblems (English)
0 references
1980
0 references
reversed geometric programming
0 references
global optimization
0 references
branch-and-bound method
0 references
global solution
0 references
general polynomial programs
0 references
reversed posynomial program
0 references
cutting plane algorithm
0 references
linear subproblems
0 references
computational evidence
0 references
