Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Hanif Sherali & Evrim Dalkiran & Leo Liberti, 2012. "Reduced RLT representations for nonconvex polynomial programming problems," Journal of Global Optimization, Springer, vol. 52(3), pages 447-469, March.
- Keith Zorn & Nikolaos Sahinidis, 2014. "Global optimization of general nonconvex problems with intermediate polynomial substructures," Journal of Global Optimization, Springer, vol. 59(2), pages 673-693, July.
- Evrim Dalkiran & Hanif Sherali, 2013. "Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality," Journal of Global Optimization, Springer, vol. 57(4), pages 1147-1172, December.
More about this item
KeywordsPolynomial programs; Reformulation-linearization technique (RLT); Grid-factor constraints; Factorable programs; BARON; Cutting planes; Valid inequalities; Global optimization;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:51:y:2011:i:3:p:377-393. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .
We have no references for this item. You can help adding them by using this form .