1. How to balance an Unbalanced transportation problem?

2. How to convert a maximisation problem into a minimisation problem?

3. Prohibited Allocation
4. How to improve a non-optimum solution
5. Meaning of degeneracy – m+n-1 = 8
6. Removal of degeneracy of first stage
7. Removal of degeneracy in second stage
8. Transhipment model

Transportation + Assignment Model

Questions MCQs

100-200 words

Find out the minimisation dual of the given maximisation problem

Relative loss matrix

Loss matrix

Opp. cost matrix

8x11 + 9X12 + 11 X21 + 13 X23 + 12 X 32 = total optimum profit

- Un balanced
- Max
-

1-2 full length question

Marks these will be out of 100

1 hour – 50 minutes

2-3 minutes
Unbalance transportation problem (the problem is of minimisation)

W1 W2 W3 Wd S
F1 15 13 18 0 30
F2 14 19 21 0 20
F3 17 16 15 0 25
Demand 15 28 22 10 75

The Initial solution is basic and feasible

If total no of occupied cells are less than the m+n-1, then the problem is said to be degenerate.

= 13*28 + 18*2 + 14*15 + 21*5 + 15*15 = 940

W1 W2 W3 Wd S
F1 15 13 (28) 18 (2) 0 30
F2 14 (15) 19 21 (5) 0 20
F3 17 16 15 (15) 0 (10) 25
Demand 15 28 22 10 75

If all opp. cost values are zero or positive then the soln is optimum otherwise not.

If all opp. all values are either positive or zero then there are multiple optimum solutions

If all opp. cost values are positive and none is negative or zero, there the solution is unique and
optimum.

W1 W2 W3 Wd S
F1 15 13 18 0 30
F2 14 19 21 0 20
F3 17 16 15 0 25
Demand 15 28 22 10 75
Degeneracy

When total no of occupied cells are less than m+n-1

Balanced Problem

Minimisation problem

W1 W2 W3 S
F1 10 8 11 15
F2 15 10 13 10
F3 12 15 16 20
Demand 20 15 10 45

Let us find Initial solution with the help of least cost method

2nd stage degeneracy

Trans-shipment model

1. Movement of goods can be in either direction

2. Transportation cost for all the possible combinations are given
Square matrix

Prohibited route cost – infinite cost is assumed