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 prob- lems arising from real-world applications. Finding a first feasible solution represents the first step for several mixed integer programming (MIP) sol vers. The feasibility pum p is a heuristic for finding feasible solutions to mixed integer linear programming (MILP) problems which is effective 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 define 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 dy- namically combining two different merit functions. Finally, we define 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 effectiveness of our approach.