The north-west rule as we get the name it starts from the top left corner and collects the amount by the supply and demand to this variable i.e. X_{11}. Then the one satisfied is crossed because the remaining variables in the column or row are considered as zero. In thecase of simultaneous satisfaction of other rows and columns then they are being crossed out. Now after the adjustments the rows and columns that are left uncrossed are again crossed, and this process is continued until only one pair of uncrossed row and column is left.

Look at the steps below:

**Step I:** starting with the north-west corner that is the top left corner and cross with the supply source (S_{1}) along with the demand of the destination centre 1 (D_{1}). In such cases there are only three possible conditions:

- D
_{1 }â‰¤ S_{1}this means that the demandat the target centre is less than the supply at source. Hence, X_{11}is equal to D_{1}a move - D
_{1}= S_{1 }this implies that the demand and supply are equal that means X_{11}equals to D_{1}and moves diagonally. - D
_{1}> S_{1 }here the demand is more than the As a result, the movement is vertical since X_{11}= S_{1}.

**Step II:** the steps are to be executed in such a manner that the value of the S-E or the right bottom corner gets a value. Letâ€™s take an example.

- Set X
_{11}= 1000 implies that the smaller amount is present at S_{1 }(1000), but D_{1}(2300) needs it. - Following the rule (c) of step I, we must proceed to cell BX vertically. As 0
_{1}> S_{1 }implies that the amount available for S_{2}(1500) with the quantity required. Number available at 0_{1}(2300-1000=1300) and set X_{11}=1300. - Again if proceeded by cell BY as because 0 < S. here supply is 1500 and demand are 1400. So set X
_{12 }= 1400. Hence here we must proceed horizontally to next cell, but as there are no horizontal cells present, so the allocation ends here.

The transportation cost associate with the solution is

Z = 2000 Ã— 1000 + 2500 Ã— 1300 + 2700 Ã— 1400.

Â Â = 20, 00,000 + 32, 50,000 + 37, 80,000

Â Â = 90, 36, 000.

**Links of Previous Main Topic:-**

- Concept of capital expenditure
- Learning objectives and chapter outline
- Limitations of operations research
- Linear programming learning objectives and outline of chapter
- Introduction learning objectives
- Duality in linear programming
- Learning objectives

**Links of NextÂ Finance Topics:-**

- Row minima method
- Column minima method
- Least cost method
- Vogels approximation method vam
- Performing optimality test
- The stepping stone method
- The modified distribution modi method or uv method
- Learning objectives and chapter outline in assignment model
- Minimization problems
- Learning objectives the transportation problems
- Special case of traveling sales man problem
- Replacement theory learning objectives and chapter outline
- Learning objectives and chapter outline for waiting line queuing theory