Morton et al. describe a greedy algorithm for solving a class of convex programming problems. The algorithm is validated by the use of polymatroid theory. In the present paper we establish the validity of the algorithm by a more elementary argument using the well known Karush–Kuhn–Tucker optimality conditions. Morton shows that a variant of the above mentioned greedy algorithm solves a related quadratic programming problem. Here we show that the variant in fact solves a slightly more general problem.
