Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts

• Main Authors: Sherali, Hanif D., Dalkiran, Evrim., Desai, Jitamitra.
• Other Authors: School of Mechanical and Aerospace Engineering
• Format: Article
• Language: English
• Published: 2013
• Online Access: https://hdl.handle.net/10356/85662; http://hdl.handle.net/10220/13111
• Institution: Nanyang Technological University

In this paper, we propose to enhance Reformulation-Linearization Technique (RLT)-based linear programming (LP) relaxations for polynomial programming problems by developing cutting plane strategies using concepts derived from semidefinite programming. Given an RLT relaxation, we impose positive semi...