Transportation problem, step by step solution of transportation problem
Vogel’s Approximation Method (VAM) Vogel’s approximation method is an improved version of the least cost entry method. It gives better starting solution as compared to any other method. Consider a general transportation problem with $m$ origins and $n$ destinations. Origin Destination $D_1$ $D_2$ $\cdots$ $D_j$ $\cdots$ $D_n$ Availability $O_1$ $c_{11}$ $c_{12}$ $\cdots$ $c_{1j}$ $\cdots$ $c_{1n}$ …
Least Cost Entry Method For Transportation Problem Least cost entry method (also known as Matrix Minima Method) is a method of finding initial basic feasible solution for a transportation problem. Consider a general transportation problem with $m$ origins and $n$ destinations. Origin Destination $D_1$ $D_2$ $\cdots$ $D_j$ $\cdots$ $D_n$ Availability $O_1$ $c_{11}$ $c_{12}$ $\cdots$ $c_{1j}$ …
Column Minima Method Column minima method is a method of finding initial basic feasible solution for a transportation problem. Consider a general transportation problem with $m$ origins and $n$ destinations. Origin \ Destination $D_1$ $D_2$ $\cdots$ $D_j$ $\cdots$ $D_n$ Availability $O_1$ $c_{11}$ $c_{12}$ $\cdots$ $c_{1j}$ $\cdots$ $c_{1n}$ $a_1$ $O_2$ $c_{21}$ $c_{22}$ $\cdots$ $c_{2j}$ $\cdots$ $c_{2n}$ …
Row Minima Method Row minima method is a method of finding initial basic feasible solution for a transportation problem. Consider a general transportation problem with $m$ origins and $n$ destinations. Origin Destination $D_1$ $D_2$ $\cdots$ $D_j$ $\cdots$ $D_n$ Availability $O_1$ $c_{11}$ $c_{12}$ $\cdots$ $c_{1j}$ $\cdots$ $c_{1n}$ $a_1$ $O_2$ $c_{21}$ $c_{22}$ $\cdots$ $c_{2j}$ $\cdots$ $c_{2n}$ $a_2$ …
North-West Corner Method The North-West cornet method is a method of finding an initial basic feasible solution to the transportation problem. Consider a general transportation problem with $m$ origins and $n$ destinations. Origin Destination $D_1$ $D_2$ $\cdots$ $D_j$ $\cdots$ $D_n$ Availability $O_1$ $c_{11}$ $c_{12}$ $\cdots$ $c_{1j}$ $\cdots$ $c_{1n}$ $a_1$ $O_2$ $c_{21}$ $c_{22}$ $\cdots$ $c_{2j}$ $\cdots$ …
Transportation Problem Transportation problem is a special class of linear programming problem that deals with transporting (or shipping) a commodity from various origins or sources (e.g. factories) to various destinations or sinks (e.g., warehouses). In this type of problem the objective is to determine the transportation schedule that minimizes the total transportation cost while satisfying …
