Exploiting Equalities in Polynomial Programming

Vera Juan (jveraandrew.cmu.edu)
Pena Javier (jfpandrew.cmu.edu)
Luis Zuluaga (lzuluagaunb.ca)

Abstract: We propose a novel solution approach for polynomial programming problems with equality constraints. By means of a generic transformation, we show that solution schemes for the (typically simpler) problem without equalities can be used to address the problem with equalities. In particular, we propose new solution schemes for mixed binary programs, pure 0-1 quadratic programs, and the stable set problem.

Keywords: Polynomial programming, 0-1 programming, stable set problem, LMI approximations

Category 1: Nonlinear Optimization

Category 2: Nonlinear Optimization (Constrained Nonlinear Optimization )

Category 3: Linear, Cone and Semidefinite Programming

Citation: Working Paper, Tepper School of Business, Carnegie Mellon University, 2006.

Download: [PDF]

Entry Submitted: 05/11/2006
Entry Accepted: 05/11/2006
Entry Last Modified: 05/11/2006

Modify/Update this entry