Least Cost Entry Method For Transportation Problem

least-cost-entry-method

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}$ …

Read more

Column Minima Method for Transportation Problem

column-minima-method

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}$ …

Read more

Row Minima Method for Transportation Problem

row-minima-method

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$ …

Read more

North-West Corner Method

north-west-corner-method

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$ …

Read more