Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (Q652688): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: SNOPT / rank | |||
Normal rank |
Revision as of 01:38, 28 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs |
scientific article |
Statements
Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (English)
0 references
15 December 2011
0 references
polynomial programs
0 references
reformulation-linearization technique (RLT)
0 references
grid-factor constraints
0 references
factorable programs
0 references
BARON
0 references
cutting planes
0 references
valid inequalities
0 references
global optimization
0 references