A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374)
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 global optimization algorithm for polynomial programming problems using a reformulation-linearization technique |
scientific article; zbMATH DE number 39238
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique |
scientific article; zbMATH DE number 39238 |
Statements
A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (English)
0 references
13 August 1992
0 references
multilinear programs
0 references
continuous polynomial programming
0 references
lower bounds
0 references
branch and bound
0 references
0 references
0 references
0 references
0 references
