A Netwok Algorithm For Solving The Transportation Problem

Solution of transportation problem is a kind of special problemin linear program, transportation problem also restricted in time, production, cost and so on in actuality. They can not been only solved by simplex method and the scheduling method in table. Over the decades years, many thoroughgoing and painstaking work had been done by some famous mathematicians for its effective Alg orithm and model building .In the first part of this paper , we give a brief introduction of Graph theory and optimization theory, we also introduced their recent research in its Algorithm, in the following part , gradually, I focus my attention on the primitive solution for transportation problem.Because the primitive solution have effect on Algorithm, this paper concerns two methods of acquiring primitive solution on network for transportation problem, and the primitive solution is almost optimal solution for solving the transportation problem with time constraint s. An example is given to demonstratethe use of thealgorithm.