• Mayuri Balu Babar
• Komal Ramkrushna Kothawade

Transportation Problem is one of the most important applications of quantitative analysis and it is the special type of Linear programming. Transportation problems are the business problems for the physical distribution of products from one place to another in a minimum time period and in minimum transportation cost. The main goal of transportation problem is to decide how to satisfy the demand at destinations using the available supply at the origins that leads to the minimization of the total cost. In this paper we are finding the TORA solution for transportation problem by Big- M Method and Two phase method and we are comparing the obtained optimal solution with Vogel’s approximation method.

Transportation Problem, Big M method, Two Phase method, TORA Software.

"Computerized Optimal Solution of Transportation Problem using BIG-M Method and Dual Simplex Method of Linear Programming Problem", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.11, Issue 4, page no.m652-m657, April-2024, Available :http://www.jetir.org/papers/JETIR2404C84.pdf

"Computerized Optimal Solution of Transportation Problem using BIG-M Method and Dual Simplex Method of Linear Programming Problem", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.11, Issue 4, page no. ppm652-m657, April-2024, Available at : http://www.jetir.org/papers/JETIR2404C84.pdf