A New Algorithm Of Direct Method For Transportation Problem

In this paper, the author presents a direct method to solve transportation problem. The Transportation Problem is a Linear Programming that is common and classic. This paper is based on the basic theories of Strongly Polynomial Algorithm for the Linear Programming, and we have considered especial structure of the Transportation Problem, through the gradient vector projection of the objective function are computed, in the feasible region an equilateral facet of low dimension is established for Transportation Problem and the optimal solutions of STP can be found directly.The first chapter, prolegomenon, simply introduces the provenience and development of Linear Programming and Transportation Problem and the newest research of the algorithm, algorithm complexity analysis. The second chapter, we introduce the basic theories of Strongly Polynomial Algorithm for the Linear Programming .The third chapter, we present a direct method to solve transportation problem. The fourth chapter we introduce a direct algorithm for Transportation Problem and the application of the algorithm. The fifth chapter end words.The dissertation mainly four pasts:1. Simplifying the some formulas of the Strongly Polynomial Algorithm for the Linear Programming by projection matrix.2. Presenting the basic theories of direct method to solve transportation problem. 3.Giving the steps of direct method to solve transportation problem and achievingthe algorithm complexity analysis.4. Introducing the application of the algorithm with some instance.Theoretical analysis and computational practice have showed that the directmethod is essentially different from the table algorithm of Transportation Problem. The algorithm of direct Method has clearer geometry meaning and simple calculation course and it is an efficiency algorithm on theory.