When Does the Positive Semidefiniteness Constraint Help In Lifting Procedures

Details When Does the Positive Semidefiniteness Constraint Help In Lifting Procedures When Does the Positive Semidefiniteness Constraint Help In Lifting Procedures

2000-06-05

arxiv.org/abs/math/0006036v1

Mathematics

Combinatorics

24 pages, 3 images

Scientific paper

We study the lift-and-project procedures of Lov\'asz 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.

Affiliated with

Also associated with

No associations

Rating

When Does the Positive Semidefiniteness Constraint Help In Lifting Procedures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with When Does the Positive Semidefiniteness Constraint Help In Lifting Procedures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and When Does the Positive Semidefiniteness Constraint Help In Lifting Procedures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-578934