Computational Experience with Applications of Bilinear Cutting Planes

详细信息    查看全文

• 作者：Keith Zorn ; Nikolaos V. Sahinidis
• 刊名：Industrial & Engineering Chemistry Research
• 出版年：2013
• 出版时间：June 5, 2013
• 年：2013
• 卷：52
• 期：22
• 页码：7514-7525
• 全文大小：525K
• 年卷期：v.52,no.22(June 5, 2013)
• ISSN：1520-5045

文摘

This work analyzes the effectiveness of cutting planes applied during the global optimization of nonconvex nonlinear and mixed-integer nonlinear programming problems arising from process synthesis and process operations. In a previous publication, we introduced algorithms for bilinear substructure detection, cutting plane identification, cut filtering, and cut selection. Our implementation embeds reformulation鈥搇inearization, lift-and-project, and advanced convex envelope construction techniques that exploit underlying bilinear substructures and tighten factorable programming reformulations at every node in the branch-and-bound tree. In this work, we utilize industrial examples to demonstrate a variety of relaxation tightening strategies afforded by these bilinear cutting plane algorithms. A detailed description and associated computational experience are presented for applied cutting planes.