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.

• Type: Conference
• Year: 2001
• Where: IPCO
• Authors: Jean B. Lasserre
• Keywords: Convex Positive Semidefinite, IPCO 2001, IPCO 2007, Optimal Solution, Optimal Values