Transportation Analysis using Different Strategies to Minimize the Cost of the Commodity

Abstract

The Transportation Problem (TP) is a special type of Linear Programming problem (LPP) that deals with the distribution of individual products from various origins of resources to different destinations of need while minimizing the entire Transportation cost. In this article, we explore how to resolve TP problems with the least cost of the commodity. Northwest, Matrix Minimum and Vogel’s Approximation methods are executed to get the minimum cost. Computer simulations were used to analyze the steps of the various approaches of solution processes. The solution technique is presented with numerical examples using the present S.K. Das, A. Goswami, and S.S. Alam [12] approach. Finally, this article shows comparison tables of Steps vs. Cost for various methods.

Cite as

Mohammad Abdur Rob, & Mohammad Abdul Alim. (2022). Transportation Analysis using Different Strategies to Minimize the Cost of the Commodity. Journal of Applied Mathematics and Statistical Analysis, 3(2), 1–9. https://doi.org/10.5281/zenodo.6812805