The application of Bilqis-Chastine-Erma method to solve to transportation problem.

The Transportation Problem (TP) is a special case of linear programming that aims to allocate a number of goods from source to destination. There are many methods to solve TP, either to find an initial feasible solution or an optimal solution to the TP. This study aims to find out how to use the BCE (Bilqis Chastine Erma) method which is the latest method at its time to get an initial feasible solution to the TP. The algorithm itself starts by allocating a number of goods according to the number of goods demanded from each column to the cell that has the lowest value in each column, then focuses on changing the allocation of a number of goods in the row with excess goods from the lowest cost cell to the second lowest cost cell or on the other hand, after checking several conditions that must be satisfied before changing the allocation, and if there is only 1 row that has not satisfied, the total minimum transportation can be calculated. The application of this method in the case of balanced data minimization with a size 3 × 4 obtained an allocation from source 1 to destination 2 as many as 5 units of goods and to destination 4 as many as 10 units of goods, from source 2 to destination 2 as many as 10 units of goods and to destination 3 as many as 15 units of goods, from source 3 to destination 1 as many as 5 units of goods and to destination 4 as many as 5 units of goods. And the minimum total transportation cost obtained is 435 units of cost. [ABSTRACT FROM AUTHOR]