Professional Documents
Culture Documents
Initial tableau
From To A B C Supply
1 6 8 10 150
2 7 11 11 175
3 4 5 12 275
Demand 200 100 300 600
Notice that there are 3 + 3 – 1 = 5 allocated cells of the 9 cells; and 4 non-basic cells.
Closed loops are formed starting in an empty cell; go to an allocated cell, then another and another
until returning to empty cell. Never go diagonal and you may pass over cells. Never visit a cell
twice.
Value = 150 * 6 + 50 * 7 + 100 * 11 + 25 * 11 + 275 * 12 = 5925
Example To evaluate the unallocated cell 3A, the loop is 3A Æ 3C Æ 2C Æ 2A with values
4 – 12 + 11 – 7 = –4
meaning that for every unit shifted (give and take) into 3A and 2C from 3C and 2A
results in a savings of 4. When shifting, feasibility constraints of supply and
demand must be maintained. Look at the giving cells 3C with 275 and 2A with 50.
Shift the minimum 50 into the receiving cells 3A and 2C to create the tableau
below.
From To A B C Supply
1 6 (150) 8 10 150
2 7 11 (100) 11 (75) 175
3 4 (50) 5 12 (225) 275
Demand 200 100 300 600
The stepping stone evaluation is done for all empty cells and the best cell improvement is chosen
for the change. Notice cell 3A entered into the basis and cell 2A left.
Loops always contain the same number of + and – cells alternating as one completes the loop.
In evaluating cell 3B, the loop is 3B Æ 3C Æ 2C Æ 2B.
Let’s evaluate cell 2A with loop 2A Æ 2C Æ 3C Æ 3A with 7 – 11 + 12 – 4 = 4. Positive quantities
mean no improvement. When all unallocated (non-basic) cells evaluate to positive
quantities, the tableau is optimal.
If the problem is one of maximization, use the same procedure except that positive quantities
imply improvement.
MODI Paths or loops in this method are determined mathematically. The tableau is modified with
u (row) and v (column) variables. Allocated cell costs cij = ui + vj.
Feasible tableau using Northwest procedure
va vb vc
From/To A B C Supply
u1 1 6 (150) 8 10 150
u2 2 7 (50) 11 (100) 11 (25) 175
u3 3 4 5 12 (275) 275
Demand 200 100 300 600
2A: u2 + va = 7 or u2 + 6 = 7 => u2 = 1;
3C: u3 + vc = 12 or u3 + 10 = 12 => u3 = 2
Thus cells 3B and 1B can improve solution. The procedure is then repeated until all empty cell
evaluations are positive.
*** Returning to initial tableau and using a different arbitrary assignment leads to the following:
Feasible tableau using Northwest procedure
va= 7 vb=11 vc=11
From/To A B C Supply
u1 = -1 1 6 (150) 8 10 150
u2 = 0 2 7 (50) 11 (100) 11 (25) 175
u3 = 1 3 4 5 12 (275) 275
Demand 200 100 300 600
Degeneracy
If number of unallocated cells is less than the number of rows R + the number of columns C – 1,
degeneracy has occurred (R + C – 1). The solution is to choose an empty cell and assign it a very
small value. The selection is a bit tricky to ensure the evaluation of the other empty cells.
For example, try evaluating any empty cell in the tableau below using the stepping stone approach.
Similarly try the MODI. Note that R + C – 1 = 3 + 3 – 1 = 6 ≠ 5.
From/To A B C Supply
1 6 8 10 (225) 150
2 7 11 (100) 11 175
3 4 (200 5 12 (75) 275
Demand 200 100 300 600
Prohibited Assignments
There may be times when a specified Supply is prohibited from satisfying a specified Demand. We
can revert to the Big M method for the cost
Maximizing
When maximizing rather than minimizing, similar to the assignment algorithm, subtract all cell
profits from the maximum overall profit and use the same minimizing procedures.
Transshipments
Each transshipment locality becomes both a supply and a demand center.