Mathematical structure of the transportation problem and recent advances on reliable methods for solving transportation problem and fuzzy transportation problem

The Transportation Problem (TP) is a unique kind of Linear Programming problem (LPP) that handles the division of individual item (finished or raw) from different sources of resource to different destination of need in such a manner that the entire Transportation cost is minimized. This thesis presents the mathematical structure for the transportation problem. It's desirable to decide a transportation schedule which is going to satisfy the foundation availabilities, non-negative restrictions and destination requirements while minimizing the entire cost of transportation. The linear MOTP is a unique sort of linear programming problem where constraints are of uniformity type and the objectives are conflicting with one another. The existing solution methodology of this problem can be partitioned into two classes. First class consist those that are producing all the sets of effective solution and the second classification speaks to the techniques that are looking for the best compromise solution among the arrangement of proficient solution.