Computer Science – Robotics
Scientific paper
2010-10-26
Computer Science
Robotics
Scientific paper
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by computing all mixed integer Gomory cuts read from all tableau's corresponding to feasible and infeasible bases. In this paper, we present an algorithm for approximating the value of the lift-and-project closure. The originality of our method is that it is based on a very simple cut generation linear programming problem which is obtained from the original linear relaxation by simply modifying the bounds on the variables and constraints. This separation LP can also be seen as the dual of the cut generation LP used in disjunctive programming procedures with a particular normalization. We study some properties of this separation LP in particular relating it to the equivalence between lift-and-project cuts and Gomory cuts shown by Balas and Perregaard. Finally, we present some computational experiments and comparisons with recent related works.
No associations
LandOfFree
On optimizing over lift-and-project closures 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 On optimizing over lift-and-project closures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On optimizing over lift-and-project closures will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-159598