Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
AbstractNo abstract is available for this item.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Springer in its journal Journal of Global Optimization.
Volume (Year): 51 (2011)
Issue (Month): 3 (November)
Contact details of provider:
Web page: http://www.springer.com/business/operations+research/journal/10898
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- 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.
- 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.
- 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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.