METODE ZERO SUFFIX PADA MASALAH TRANSPORTASI (Studi Kasus : Industri Rumahan Keripik Tempe Camilan Dua Putri di Kabupaten Wonogiri )

Abstract

Transportation problem is a special case of a linear programing which aim to control stuff distribution from the sources which prepared the same products to the places which need in an optimal way. In this paper discusses about Zero Suffux Methode to solve transportation problem. In Zero Suffix Methode there is no need step to determine first visible sollution but to get an optimal sollution. The principal of this methode is to reduce bar and coloumn to get zero value in every bar and coloumn. Suffix value obtainable with sum up the cost at the nearest cell which in row and in coloumn with the cell which zero value devided with total cells which added. The biggest Suffix value will be alocated first. For the example case in home industry Camilan Dua Putri, to solve transportations problem used Zero Suffix Methode and Least Cost Methode – MODI. . The last calculation between Zero Suffix methode and MODI is same, that is Rp. 1.940.000,00 Keywords : Transportation problem, Zero Suffix Methode, Modified Distribution Methode, Least Cost Methode.