Solving of transportation problem by various methods of cardinal directions

Abstract

The transportation problem is one of the special class of linear programming problems. It is concerned with the
transportation of the commodity from ‘m’ sources to ‘n’ destinations. The main objective of the transportation problem is to
minimize the distribution cost while satisfying both the limits of supply and demand. In this paper we have tried to reveal that
the projected methods such as north-west, north-east, south-east and south -west, for finding initial basic feasible solution of
a transportation problem, do not always provide initial basic feasible solution at all times.