Date: 21 Jun 2001

An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We consider the general nonlinear optimization problem in 0- 1 variables and provide an explicit equivalent convex positive semidefinite program in 2n - 1 variables. The optimal values of both problems are identical. From every optimal solution of the former one easily find an optimal solution of the latter and conversely, from every solution of the latter one may construct an optimal solution of the former.