On linear programming relaxations for solving polynomial programming problems (Q1654348)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6914688
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On linear programming relaxations for solving polynomial programming problems |
scientific article; zbMATH DE number 6914688 |
Statements
On linear programming relaxations for solving polynomial programming problems (English)
0 references
8 August 2018
0 references
reformulation-linearization technique (RLT)
0 references
\(J\)-set relaxation
0 references
McCormick inequalities
0 references
polynomial programming problems
0 references
linear programming relaxations
0 references
branch-and-bound algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.836638867855072
0 references
0.8275364637374878
0 references
0.8084891438484192
0 references
0.7960620522499084
0 references
