This paper discusses the classical resource allocation problem. By very elementary arguments on Lagrangian duality it is shown that this problem can be reduced to a single one-dimensional maximization of a differentiable concave function. Moreover, a simple graphical method is developed and applied to a family of well-known problems from the literature.