AN ALGORITHM FOR THE HITCHCOCK TRANSPORTATION PROBLEMS WITH QUADRATIC COST FUNCTIONS

Abstract

In this paper an algorithm is given for the Hitchcock transportation problems (HTPQ). A procedure has beenproposed which involves successively minimising theLagrangian with respect to each of its dualcoordinates. The fact that the algorithms for optimalallocation problems having quadratic objective functions(APQ) can be used for the maximising procedure in networktransportation problems with quadratic costs functions wasinvestigated, and APQ studied in detail. The applicationof algorithms proposed by the authors to solving HTPQ isconsidered. In particular several examples are given ofrelatively large-scale problems, with computational times.