An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs

  • Jean B. Lasserre
Conference paper

DOI: 10.1007/3-540-45535-3_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2081)
Cite this paper as:
Lasserre J.B. (2001) An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs. In: Aardal K., Gerards B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2001. Lecture Notes in Computer Science, vol 2081. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Jean B. Lasserre
    • 1
  1. 1.LAAS-CNRSFrance

Personalised recommendations