Original Research Paper Mathematics 1-Introduction : In the light of the progress and rapid development of the applications of research in applications fields, the need to rely on scientific tools and cleaner for data processing has become a prominent role in the resolution of decisions in industrial and service institutions according to the real need of these methods to make them scientific methods to solve the problem Making decisions for the purpose of making the departments succeed in performing their planning and executive tasks. Therefore, we found it necessary to know the transport model in general and to use statistical methods to reach the optimal solution with the lowest possible costs in particular. And you know The Transportation Problem (also called Hitchcock Problem and denoted by TP) is one of the classic problems in operation research, a special type of linear programming problem(2): Where : cij = unit transportation cost for each source i to destination j. xij = number of units from source to destination. ai = supply from sources ; bj= demand from destination We have to determine the optimal shipments from a given set of origins to a given set of destinations in such a way as to minimize the total (7) transportation costs. Have been widely studied in computer science and operations research. It is one of the fundamental problems of network flow problem which is usually use to minimize the transportation cost for industries with number of sources and number of destination while (1) satisfying the supply limit and demand requirement. The problem is constrained by known upper limits on the supply at the various origins and by the necessity to satisfy the known demand at each destination. The classical transportation model assumes that the per unit cost for each potential origin destination pair is known a (2) priori. It was first studied by F. L. Hitchcock in 1941, then separately by T. C. Koopmans in 1947, and finally placed in the framework of linear programming and solved by simplex method by G. B. Dantzig in 1951 (3)(4) .The first step of the simplex method for the transportation problem is to determine an initial basic feasible solution. The simplest procedure for finding an initial basic feasible solution was proposed by Dantzig (1951) and was termed the northwest corner rule by charnes (5)