Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems

An interior point approach to solving linear programming relaxations of cutting problems attained through the application of branch and cut techniques for integer programming problems. The method involved fixing variables using the dual feasible solution and generating Gomory-like cutting planes and lift-and-project cutting planes from the objective function without resolving the relaxation to optimality.