An interior point cutting plane heuristic for mixed integer programming

We explore the use of interior point methods in finding feasible solutions to mixed integer programming. As integer solutions are typically in the interior, we use the analytic center cutting plane method to search for integer feasible points within the interior of the feasible set. The algorithm searches along two line segments that connect the weighted analytic center and two extreme points of the linear programming relaxation. Candidate points are rounded and tested for feasibility. Cuts aimed to improve the objective function and restore feasibility are then added to displace the weighted analytic center until a feasible integer solution is found. The algorithm is composed of three phases. In the first, points along the two line segments are rounded gradually to find integer feasible solutions. Then in an attempt to improve the quality of the solutions, the cut related to the bound constraint is updated and a new weighted analytic center is found. Upon failing to find a feasible integer solution, a second phase is started where cuts related to the violated feasibility constraints are added. As a last resort, the algorithm solves a minimum distance problem in a third phase. The heuristic is tested on a set of problems from MIPLIB and CORAL. The algorithm finds good quality feasible solutions in the first two phases and never requires the third phase.

[1]  J. Gondzio,et al.  Using an interior point method for the master problem in a decomposition approach , 1997 .

[2]  E. Balas,et al.  Pivot and shift - a mixed integer programming heuristic , 2004, Discret. Optim..

[3]  Frederick S. Hillier,et al.  Efficient Heuristic Procedures for Integer Linear Programming with an Interior , 1969, Oper. Res..

[4]  Timo Berthold,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Improving the Feasibility Pump Improving the Feasibility Pump , 2022 .

[5]  E. Balas,et al.  Pivot and Complement–A Heuristic for 0-1 Programming , 1980 .

[6]  Samir Elhedhli,et al.  The integration of an interior-point cutting plane method within a branch-and-price algorithm , 2004, Math. Program..

[7]  Fred W. Glover,et al.  General Purpose Heuristics for Integer Programming—Part II , 1997, J. Heuristics.

[8]  Jacek Gondzio,et al.  Solving nonlinear multicommodity flow problems by the analytic center cutting plane method , 1997, Math. Program..

[9]  G. Sonnevend.  New Algorithms in Convex Programming Based on a Notion of “Centre” (for Systems of Analytic Inequalities) and on Rational Extrapolation , 1988 .

[10]  Robert G. Jeroslow,et al.  Experimental results on Hillier's linear search , 1975, Math. Program..

[11]  Thorsten Koch,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Miplib 2003 , 2022 .

[12]  John E. Mitchell,et al.  Computational Experience with an Interior Point Cutting Plane Algorithm , 1999, SIAM J. Optim..

[13]  Matteo Fischetti,et al.  A feasibility pump heuristic for general mixed-integer problems , 2007, Discret. Optim..

[14]  Jacek Gondzio,et al.  Warm start of the primal-dual method applied in the cutting-plane scheme , 1998, Math. Program..

[15]  Jean-Philippe Vial,et al.  On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm , 1993, Math. Program..

[16]  Egon Balas,et al.  Octane: A New Heuristic for Pure 0-1 Programs , 2001, Oper. Res..

[17]  Jorge J. Moré,et al.  The NEOS Server , 1998 .

[18]  Fred W. Glover,et al.  The feasibility pump , 2005, Math. Program..

[19]  Fred W. Glover,et al.  Solving zero-one mixed integer programming problems using tabu search , 1998, European Journal of Operational Research.

[20]  Fred W. Glover,et al.  General purpose heuristics for integer programming—Part I , 1997, J. Heuristics.

[21]  J. Christensen,et al.  Mixed integer programming. , 1972 .

[22]  J. Goffin,et al.  Decomposition and nondifferentiable optimization with the projective algorithm , 1992 .

[23]  Yinyu Ye,et al.  Interior point algorithms: theory and analysis , 1997 .

[24]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[25]  Michael J. Todd,et al.  Solving combinatorial optimization problems using Karmarkar's algorithm , 1992, Math. Program..

[26]  Frederick S. Hillier,et al.  A heuristic ceiling point algorithm for general integer linear programming , 1992 .