Solve the following transportation problem using North-west corner method & Matrix minimum method.
. Solve the following transportation problem using North-west corner method & Matrix minimum method.
Factories | Distribution Centres | Supply | |||
C1 | C2 | C3 | C4 | ||
F1 | 3 | 2 | 7 | 6 | 50 |
F2 | 7 | 5 | 2 | 3 | 60 |
F3 | 2 | 5 | 4 | 5 | 25 |
Requirements | 60 | 40 | 20 | 15 |
- Solution through North-west corner method.
- Solution through Matrix minimum method
- Computation/Solution to the problem
Factories |
Distribution Centre | Supply | |||
C1 | C2 | C3 | C4 | ||
F1 | 3 60 | 2 -10 | 7 | 6 | 50 |
F2 | 7 | 5 50 | 210 | 3 | 60 |
F3 | 2 | 5 | 4 10 | 5 15 | 25 |
Requirements | 60 | 40 | 20 | 15 | 135 |
Since total demand = 135 = total supply, the problem is balanced. The initial basic feasible solution is obtained by Vogel’s approximation method. Table 3 depicts the initial solution.
The transportation cost can be calculated from Table, which is as follows:
= 3*60 + 2 *(-10) + 5* 50 + 2*10 + 4* 10 +5*15
=180-20+250+20+40+75
= 545
for solution contact us :
SMU MBA fall-2017
Dear Students,
SMU MBA fall-2017 Assignments are available. For Booking ,Kindly mail us on kvsude@gmail.com OR call us to +91 9995105420 or S M S your “ Email ID ” us in the following Format “ On +91 9995105420 we will reach back you with in 24H ”