A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:17, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique |
scientific article |
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
