In a material control problem by Hodgson and Lowe [4], an iterative algorithm is used to minimize a function which considers, fornitem classes, the setup cost, inventory carrying cost, and warehouse material handling cost. We show that each subproblem in this iterative scheme can be reduced to a convex program. As a by-product of this result, we show that a stationary point of a Hodgson-Lowe subproblem is a global minimum of the subproblem.