Abstract
In this paper we give an algorithm for the Hitchcock transportation problems (HTPQ). The algorithm de-scribed below has been studied in connection with "Network transportation problems with quadratic costs functions (NTQ)" by l. Takahashi and "Algorithms for optimal allocation problems having quadratic objective function (APQ)" by authors. Takahashi proposed a procedure which involves successively minimizing the Lagrangian with respect to each of its dual coordinates. We investigated the fact that the algorithms for APQ can be used for maximizing procedure in NTQ and studied APQ in detail. We consider the application of algorithms proposed by authors to solving HTPQ. In particular we give several examples of relatively large-scale (3000-20000 variables) problems with computational times (1 -10 sec. on a HITAC M-180 computer for these large-scale problems).
