Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems (Q1361075)
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: Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems |
scientific article; zbMATH DE number 1038454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems |
scientific article; zbMATH DE number 1038454 |
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
0.836638867855072
0 references
0.8349095582962036
0 references
0.8194682002067566
0 references
0.8112356662750244
0 references
0.7964219450950623
0 references
