Page cuts for integer interval linear programming

Abstract This paper establishes a new class of finitely convergent cutting plane methods to solve integer linear problems of the form: Maximize cTx, subject to a⩽Ax⩽b and x integer. Unlike standard cutting planes, the cuts given here are not derived in terms of the x variables directly but rather from a transformation of these variables onto an n-dimensional page. It will be shown that this approach has computationally attractive features not found in other methods.