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

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

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...

Full description

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

Similar Items

Similar Items