AbstractThe transportation method of linear programming is extended to a more general class of problem, for which the "stepping-stone method" of Charnes and Cooper fails. The method is applicable to various problems in the optimum scheduling of production and transport.This paper reviews the relevant theory, and then describes an efficient computational method, applicable to computers of moderate capacity. Many features of the transportation method are retained. In particular, the amount of information which must be retained, at each stage of calculation, is much less, for a large problem, than is required for the simplex or revised simplex methods.