In this article we provide a lower bound on the improvement of the Euclidean distance to an optimal solution in the modified subgradient method of Camerini et al. This is a stronger convergence property than that originally derived by those authors. Furthermore, this lower bound is shown to be strictly better than that of the standard subgradient method. This result may partially explain the successful computational improvement of the modified subgradient method.