AbstractA new formulation is proposed for the problem of the optimal phasing out over some time period of a group of similar items of capital equipment. The possibility of hiring items from an external source is explicitly considered, as are policy constraints which restrict the minimum number of items which may be held at any time. Initially formulated as an integer program, the problem is transformed to the familiar transportation form of linear programming.