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 |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 04:04, 5 March 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
