A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach

Mixed-Integer optimization is a powerful tool for modeling many optimization problems arising from real-world applications. Finding a rst feasible solution represents the rst step for several MIP solvers. The Feasibility pump is a heuristic for nding feasible solutions to mixed integer linear problems which is eective even when dealing with hard MIP instances. In this work, we start by interpreting the Feasibility Pump as a Frank-Wolfe method applied to a nonsmooth concave merit function. Then, we dene a general class of functions that can be included in the Feasibility Pump scheme for measuring solution integrality and we identify some merit functions belonging to this class. We further extend our approach by dynamically combining two dierent merit functions. Finally, we dene a new version of the Feasibility Pump algorithm, which includes the original version of the Feasibility Pump as a special case, and we present computational results on binary MILP problems showing the eectiveness of our approach.

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

[2]  Olvi L. Mangasarian,et al.  Machine Learning via Polyhedral Concave Minimization , 1996 .

[3]  Jonathan Eckstein,et al.  Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming , 2007, J. Heuristics.

[4]  Jordi Castro,et al.  Using the analytic center in the feasibility pump , 2011, Oper. Res. Lett..

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

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

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

[8]  David L. Woodruff,et al.  Scatter Search to Generate Diverse MIP Solutions , 2000 .

[9]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

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

[11]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[12]  John Baxter,et al.  Local Optima Avoidance in Depot Location , 1981 .

[13]  Claude Le Pape,et al.  Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..

[14]  Marco Sciandrone,et al.  Concave programming for minimizing the zero-norm over polyhedral sets , 2010, Comput. Optim. Appl..

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

[16]  Matteo Fischetti,et al.  Feasibility pump 2.0 , 2009, Math. Program. Comput..

[17]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..

[18]  Robert H. Leary,et al.  Global Optimization on Funneling Landscapes , 2000, J. Glob. Optim..

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

[20]  S. Lucidi,et al.  Exact Penalty Functions for Nonlinear Integer Programming Problems , 2010 .

[21]  Stefan Schäffler,et al.  Applied Mathematics and Parallel Computing: Festschrift for Klaus Ritter , 2012 .

[22]  Stefano Lucidi,et al.  Feasibility Pump-like heuristics for mixed integer problems , 2010, Discret. Appl. Math..

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

[24]  Gérard Cornuéjols,et al.  An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..

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

[26]  Andrea Lodi,et al.  A storm of feasibility pumps for nonconvex MINLP , 2012, Mathematical Programming.

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

[28]  Matteo Fischetti,et al.  Boosting the feasibility pump , 2014, Mathematical Programming Computation.

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

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

[31]  Kien Ming Ng,et al.  An algorithm for nonlinear optimization problems with binary variables , 2010, Comput. Optim. Appl..

[32]  Gérard Cornuéjols,et al.  A Feasibility Pump for mixed integer nonlinear programs , 2009, Math. Program..

[33]  Francesco Rinaldi.  New results on the equivalence between zero-one programming and continuous concave programming , 2009, Optim. Lett..