The role of Transportation Problem in Operations research is significant. Its primary goal is to move quantities of goods stored at different locations to diverse destinations in a way that minimizes transportation costs, maximizes profits, or reduces total time. To obtain an initial basic feasible solution to the linear programming problem, the North-West Corner Method, Matrix Minima Method and Vogel’s Approximation Method can be used. By comparing their outcomes, we can present the results in a table