An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806)
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: An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms |
scientific article; zbMATH DE number 5081905
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms |
scientific article; zbMATH DE number 5081905 |
Statements
An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (English)
0 references
5 January 2007
0 references
Bilinear
0 references
Convex relaxation
0 references
Global optimization
0 references
NLP
0 references
Reformulation-linearization technique
0 references
RRLT constraints
0 references
0 references
0 references
0 references
0 references
0.8391208
0 references
0.8306731
0 references
0.8237146
0 references
0 references
0 references
0.8159768
0 references
0.81227124
0 references
