A Brief Overview of the Classical Transportation Problem Md. Ashraful Babu 1 , Md. Mortuza Ahmmed 2 , Zahir Rayhan Salim 3 , Md. Shohel Babu 4 , Mohammad Abdul Hoque 5 1 Assistant Professor, Department of Quantitative Sciences, IUBAT-International University of Business Agriculture and Technology, Dhaka, Bangladesh (Email id: ashraful388@gmail.com) 2 Assistant Professor, Department of Mathematics, American International University - Bangladesh (AIUB), Dhaka, Bangladesh (Email id: mortuza123034@gmail.com) 3 Assistant Professor, College of Business Administration, IUBAT-International University of Business Agriculture and Technology, Dhaka, Bangladesh (Email id: zahir.rayhan@iubat.edu) 4 Lecturer, Department of CSE, Southeast University, Dhaka, Bangladesh (Email id: shohel.babu@seu.edu.bd) 5 Professor, BRAC Business School, BRAC University, Dhaka, Bangladesh (Email id: abdul.hoque@bracu.ac.bd) (Corresponding author: Md. Ashraful Babu, ashraful388@gmail.com, babu@iubat.edu) ABSTRACT The classical transportation problem (TP) is a distribution problem where commodities are transferred from many sources to many destinations with a least total cost. Also, TP considered as one of the classification of a linear programming (LP) problem, and it has a great alliance to inaugurate the linear program and its solution procedure. The variations of classical TP generally depend on the supply and demand constraints. The effectiveness of the algorithm for solving TP is determined by the closeness to the least cost solution to the TP. In this paper, the existence of solution to the TP, the basic theorems of classical TP, are stated and proven in a new manner. Also, an analysis has been performed to indicate the limitations of the existing solution procedures. Finally, the necessary and sufficient conditions are carried out for the optimality to the TP. Keywords- Initial Feasible Solution, MODI, Optimal Solution, Transportation Problem, SSM, VAM Journal of Xi'an University of Architecture & Technology Volume XII, Issue IV, 2020 ISSN No : 1006-7930 Page No: 3425