Solving Transportation Problem with the help of Integer Programming Problem

Abstract

The Transportation Problem is one of the subclass of linear programming problem which the objective is to minimize transportation cost of goods transport to various origins to different destinations. In this paper we are representing the transportation problem for Albert David Company to reduce transportation cost, its working with 3 plants and 14 depots in all over India. In [6][7] we are solve the transportation problem with the help of dual simplex and two phase method. Here we are solving this problem with the help of Branch and Bound Method of Integer programming Problem by using Tora software and we are comparing the obtained optimal solution with Vogel Approximation Method.