New Algorithm For Transportation Problem

In this paper, the author presents two k inds of methods for the Transportation Problems, which are Traditional Transportation Problem and Transportation Problem with time constraints.For traditional problem this paper is based on the basic theories of Interior -Point Method for the Linear Programming, and we have considered special structure of the Transportation Problem. The method is finding an interior point in the feasible region, followed by the central path, we can find a approximate optimal solution.New approach to solve Transportation Problems with time constraints is discussed in the practice.And an example is given to illustrate its feasibility.The paper has fiveparts. The first partis introduction The second part, simply introduces the history and development of L inear Programming and Transportation Problem. The third part, introduces the basic theory of Interior -Point Method. Thanks for Yinyu Ye[2] and Andersen[3] and theirexcellent work. The fourth part, gives the theory and steps of Interior -Point Method for Transportation Problem and approach to solve Transportation Problems with time constraints. The fifth part, function as ending paragraph for self-estimate.My work mainly includes five parts:(1) Giving the special structure of the transportation problem;(2) Presenting the basic theories and conception of Interior Point Method to solve Transportation Problem;(3) Giving the steps of Interior -Point Method to solve Transportation Problem.(4) Giving the approach to time constraint s problem on the precedence principle(5) Introducing the application of the methodfor time constraints problem...