A Generated Cut for Primal Integer Programming

Publisher Website
Google Scholar
Abstract
This paper develops a new cutting plane for primal integer programming. This cut, when it exists and is vised as pivot row, has the property that the minimum of the simplex evaluators of the next tableau is strictly larger (by an integer) than the minimum for the current tableau. The paper gives a sufficient condition in the form of a linear program for the existence of such a cut, and proposes an algorithm for generating such cuts. It also presents two additional sufficient conditions. The process of cut generation is then imbedded into a convergent primal algorithm to be used in an attempt to overcome the proof-of-optimality problem experienced with the primal algorithm.

This publication has 0 references indexed in Scilit: