An initial basic feasible transportation solution based on the north-west corner rule programming in c

Abstract

 Transportation is one of the most important problems in operations research because it is involved in our daily activities and is primarily concerned with logistics. It is a very important class of linear programming model that deals with the condition of transporting commodities or resources from sources to destinations. The problem's primary goal is to save transportation time and steps by using minimal transformation costs. The solution to this problem is classified into two types: the Initial Basic Feasible Solution (IBFS) and the Optimal Solution (OS). The purpose of this research is to develop a programme that employs the North West Corner Rule to determine the Initial Basic Feasible solution to the transportation problem (NWCR). This programme was written in C# and can handle both balanced and unbalanced situations. Furthermore, the North West Corner Rule has a broader application than other methods for solving transportation problems. Finally, the proposed programme is more useful for decision makers who deal with unbalanced supply and demand quantities on a regular basis.