Sciweavers

IPCO
2001

An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs

13 years 5 months ago
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs
Abstract. We consider the general nonlinear optimization problem in 01 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.
Jean B. Lasserre
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2001
Where IPCO
Authors Jean B. Lasserre
Comments (0)