An investigation of methods for solving the transportation problem within the framework of a cyclic real-time digital computer program system is reported.Two techniques for obtaining a basic feasible solution, the Northwest Corner Rule and a modification of Vogel's Approximation Method, are considered.The solution is then iterated using the Dual Theorem.A statistical analysis is made of the solution times of each method for different matrix dimensions.Consideration is given to methods for truncating the process, and recommendations are made.The use of Vogel's Approximation Method is shown to yield significantly faster solution times.