An Application of Interior Point Method to 0-1 Mixed Integer Programing Problems

Abstract

In many fields, 0-1 mixed integer programming (MIP) problems are prevailingly used. These problems are often solved by the branch and bound method. However, it requires much calculation time. Some of the 0-1 MIP problems have multiple optimal solutions on the first relaxed linear programming problems. In this paper, a method which is an application of the interior point method is proposed to solve these problems. It will be shown that the proposed method is more effective than the conventional method and by the numerical experiments it will be shown that the proposed method reduces the number of created subproblems and the calculation time on the various size problems.