论文信息 - When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?

When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?

We study the lift-and-project procedures of LovAisz and Schrijver for 0-1 integer programming problems. We prove that the procedure using the positive semidefiniteness constraint is not better than the one without it, in the worst case. Various examples are considered. We also provide geometric conditions characterizing when the positive semidefiniteness constraint does not help.

Michel X. Goemans | Levent Tunçel

[1] Egon Balas,et al. programming: Properties of the convex hull of feasible points * , 1998 .

[2] Jean-Paul Doignon,et al. Convexity in cristallographical lattices , 1973 .

[3] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[4] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[5] Tamon Stephen,et al. On a Representation of the Matching Polytope Via Semidefinite Liftings , 1999, Math. Oper. Res..

[6] William J. Cook,et al. On the Matrix-Cut Rank of Polyhedra , 2001, Math. Oper. Res..

[7] 丸山徹. Convex Analysisの二,三の進展について , 1977 .

[8] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[9] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..