Abstract
This paper introduces a new approach to optimize the cost per unit of product for the Transportation Problem to achieve better outcomes. We present Basic Feasible Solution (BFS) approach compromised of five main steps: (1) Create a Matrix A = mod vertical bar Supply(s(i))-Demand(d(j))vertical bar (2) Add the cost of each cell of cost matrix C with corresponding elements of Matrix A and Create Matrix B. (3) Mark number in Ascending order of each elements of Matrix B from 1 to mxn (4) If s(i) not equal d(j), then zeta = vertical bar small(s(i), d(j))vertical bar, else zeta = s(i) or d(j), Assign zeta in Matrix B to smallest number from 1 to mxn, and cut the rest of elements of row zeta or column zeta and subtract zeta from other than selected; and (5) Repeat step 4, until all the supply and demand become zero. This solution approach finds the basic feasible solution of TP with the same complexity for solving Vogel's approximation method (VAM).