Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems (Q1361075): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:53, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems |
scientific article |
Statements
Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems (English)
0 references
19 February 1998
0 references
outer-approximations
0 references
constrained global optimization
0 references
linear programming relaxations
0 references
polynomial programming
0 references
reformulation-linearization technique
0 references
