transportation matrix mumbai

A B C supply
1 10 14 10 210
2 12 17 20 140
3 11 11 12 150
AHD 7 14 16 160
demand 220 220 220

A B C supply
1 0 0 210 210
2 60 80 0 140
3 0 140 10 150
AHD 160 0 0 160
demand 220 220 220

Z 6960
transportation matrix mumbai

A B C supply
1 10 14 10 210
2 12 17 20 140
3 11 11 12 150
mum 18 8 13 160
demand 220 220 220 660
500

A B C supply
1 0 0 210 210
2 140 0 0 140
3 80 60 10 150
mum 0 160 0 160
demand 220 220 220

Z 6720

Z value is less for mumbai. Plant should be at mumbai

M - A big integer W1 W2 W3 W4 production
W1 RT 10 13 16 19 700
W2 RT 13 10 13 16 700
W2 OT 18 15 18 21 200
W3 RT 21 18 15 18 700
W3 OT 26 23 20 23 200
W4 RT 21 18 15 13 800
demand 500 700 900 1000
Inventory 0 3 6 9 250
Z
40300
W1 W2 W3 W4 Row sum
W1 RT 500 0 0 200 700
W2 RT 0 500 200 0 700
W2 OT 0 200 0 0 200
W3 RT 0 0 700 0 700
W3 OT 0 0 0 0 0
W4 RT 0 0 0 800 800
[Link] 500 700 900 1000

company will give a discount of 3 rs for the demand met in every subsequent month
and W4 can produce 800 with a production cost of 13
uent month
 O M P average time std dev variance
1 5 10 22 11.17 2.83 8.03
2 20 33 57 34.83 6.17 38.03
3 6 17 33 17.83 4.50 20.25
4 2 8 20 9.00 3.00 9.00
5 7 10 12 9.83 0.83 0.69
6 8 11 18 11.67 1.67 2.78
7 7 15 28 15.83 3.50 12.25
8 19 24 41 26.00 3.67 13.44
9 4 6 10 6.33 1.00 1.00
10 5 10 16 10.17 1.83 3.36
11 5 9 12 8.83 1.17 1.36
12 5 9 24 10.83 3.17 10.03
13 11 14 15 13.67 0.67 0.44
14 12 15 20 15.33 1.33 1.78
15 14 16 25 17.17 1.83 3.36
16 2 3 5 3.17 0.50 0.25

77.00
80.17

Z 2.538311 77.67 6.47 52.17

99.43% 6.4722222222 7.2226496
7.0833333333 0.6018875

ES EE LS LE slack
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
 company
training cost A B C D
E 0.5 0.4 0.6 0.3
transfer
to F 0.6 0.4 0.6 0.3
G 0.5 0.3 0.7 0.3

company
relocation cost A B C D
E 2.5 3.6 3.4 4.7
transfer
to F 2.4 4.6 3.4 1.7
G 2.5 2.7 3.3 2.7

company
Total cost A B C D additional requirements
E 3 4 4 5 350
transfer
to F 3 5 4 2 450
transfer
to
G 3 3 4 3 200
dummy 1000 1000 1000 1000 100
no of employees 200 400 300 200 1100
1100

requirement less than available employess, hence dummy company added

company
Total cost A B C D additional requirements
E 175 175 0 0 350
transfer
to F 0 0 275 175 450
G 0 200 0 0 200
dummy 25 25 25 25 100
no of employees 200 400 300 200
re trenching cost 6 5 6 7
max retrenched 25 25 25 25
Z 103875

Here it is converged with 25 employess from all 4 companies

M - A big integer W1 W2 W3 W4 production
W1 RT 10 13 16 19 700
W2 RT 1000 10 13 16 700
W2 OT 1000 15 18 21 200
W3 RT 1000 1000 15 18 700
W3 OT 1000 1000 20 23 200
W4 RT 1000 1000 1000 15 700
demand 500 700 900 1000
Inventory 0 3 6 9 250
Z
42700
W1 W2 W3 W4 Row sum
W1 RT 500 0 0 200 700
W2 RT 0 500 100 100 700
W2 OT 0 200 0 0 200
W3 RT 0 0 700 0 700
W3 OT 0 0 100 0 100
W4 RT 0 0 0 700 700
[Link] 500 700 900 1000
shipment cost ware houses
1 2 3 4 Supply
Sankrali 1 3 5 2 7 10000
Channo 2 1 8 4 2 7000
Ranjangaon 3 5 9 2 6 4000
Demand 4000 6000 2000 7000 19000
21000
demand is less than supply

quantity to be transported
1 2 3 4 Supply
Sankrali 1 4000 6000 0 0 10000
Channo 2 0 0 0 7000 7000
Ranjangaon 3 0 0 2000 0 2000
Demand 4000 6000 2000 7000

supply constraints
 X11+X12+X13+X14<=10000
X21+X22+X23+X24<=7000
X31+X32+X33+X34<=4000

demand constraints

X11+X21+X31=4000
X12+X22+X32=6000
X13+X23+X33=2000
X14+X24+X34=7000

optimising function

minimise transportation cost

X11*3+X12*5+X13*2+X14*7+X21*1+X22*8+X23*4+X24*2+X31*5+X32*9+X33*2+X34*6

Z 60000
shipment cost

Market 1 Market 2 Market 3 Market 4 Supply

WH1 3 7 6 4 5
WH2 2 4 3 2 2
WH3 4 3 8 5 3
Demand 5 4 3 4 16
10

demand is greater than suppy. Now we need a dummy source

Market 1 Market 2 Market 3 Market 4 Supply

WH1 3 7 6 4 5
WH2 2 4 3 2 2
WH3 4 3 8 5 3
dummy 1000 1000 1000 1000 10
Demand 5 4 3 4

nothing to be allocated to existing best routes from dummy source. Hence shipment cost to be kept high

Market 1 Market 2 Market 3 Market 4 Supply

WH1 5 4 3 4 16
WH2 0 0 0 0 0
WH3 0 0 0 0 0
dummy 0 0 0 0 0
Demand 5 4 3 4

z 77
dummy should be kept somewhere near market 3
 company
training cost A B C D
E 0.5 0.4 0.6 0.3
transfer
to F 0.6 0.4 0.6 0.3
G 0.5 0.3 0.7 0.3

company
relocation cost A B C D
E 2.5 3.6 3.4 4.7
transfer
to F 2.4 4.6 3.4 1.7
G 2.5 2.7 3.3 2.7

company
Total cost A B C D additional requirements
E 3 4 4 5 350
transfer
to F 3 5 4 2 450
transfer
to
G 3 3 4 3 200
dummy 1000 1000 1000 1000 100
no of employees 200 400 300 200 1100
1000

requirement less than available employess, hence dummy company added

company
Total cost A B C D additional requirements
E 0 100 250 0 350
transfer
to F 200 0 50 200 450
G 0 200 0 0 200
dummy 0 100 0 0 100
no of employees 200 400 300 200
re trenching cost 6 5 6 7

Z 103700

Here it is converged that 100 employees from company B to be retrenched which is not correct
 Shipment cost 4 5 Supply Shipping cost 6 7 8
1 29 15 200 4 9 7 4
2 12 14 300 5 8 6 5
3 11 12 100 Demand 150 400 50

Supply constraints Demand constraints 4

x14+x15<=200 x46+x56=150 1 0
x24+x25<=300 x47+57=400 2 300
x34+x35<=100 x48+58=50 3 0
[Link] 300

Transhipment constraints
Whatever comes in has to go out CROSS-DOCKING

x14+x24+x34=x46+47+x48 (x14+x24+x34)-(x46+47+x48)=0 4
x15+x25+x35=x56+x57+x58 (x15+x25+x35)-(x56+x57+x58)=0 5

Objective Function
Minimize Z = 29x14+15x15+12x24+14x25+11x34+12x35+9x46+7x47+4x48+8x56+6x57+5x58
 5 row sum 6 7 8 row sum
200 200 4 0 250 50 300
0 300 5 150 150 0 300
100 100 [Link] 150 400 50
300

Z
Transit nodes 11850
LHS RHS
0 0
0 0
pbm page no 290

W1 W2 suppy P1 P2
farm A 3 2 100 W1 2 1
farm B 4 3 200 W2 3 2
farm C 2.5 3.5 200 demand 50 150

row sum
W1 W2 P1 P2
farm A 0 100 100 W1 0 150
farm B 0 200 200 W2 50 0
farm C 200 0 200 col sum 50 150
200 300

transit nodes z
LHS RHS
1 0 0
2 0 0
P3
4
5
300

P3
50 200
250 300
300

3050
 530000
test

Expand
450000
no test

Node Revenue Cost

6 1600000 -150000
7 -700000 -150000

Node 3: 0.8(1450000)+0.2*(-850000) =990000

8 1600000 -150000
9 -700000 -150000
Node 4: 0.3(1450000)+0.7*(-850000) =-160000

Node 2: 0.6 (990000) +0.4 (-160000) = 530000

10 1600000 0
11 -700000 0
Node 5: 0.5(1600000)+0.5*(-700000) =450000

benefit of taking test is 80000 ( test cost is 1500000)

not worth taking test
 success
6
990000 0.8
pass

0.6
3 0.2
530000 7
fail
2 0.3
success
0.4 8
fail 4 fail
-160000 0.7 9

450000 0.5 success

10
5

11
0.5 fail

Profit
1450000
-850000

0000) =990000

1450000
-850000
0000) =-160000

0000) = 530000
 1600000
-700000
0000) =450000

est is 80000 ( test cost is 1500000)

delete node 3
 node revenue cost profit
7 4000000 400000 3600000
8 400000 400000 0
expected value node 2 = 0.2X3600000 = 720000
9 4000000 500000 3500000
10 400000 500000 -100000
expected value node 6 = 0.05X3500000+0.95X(-100000) = 80000
11 650000 100000 550000
expected value node 5 =550000
12 400000 0 400000
13 0 0 0
expected value node 4 = 400000

its better to go for drilling as expected value of node 2 is high

 Min Z = 9X11+4X12+5X13………..+7X44

Cost Project
Team 1 2 3 4 X11+X12+X13+X14=1
1 9 4 5 8 X21+X22+X23+X24=1
2 6 9 8 7 X31+X32+X33+X34=1
3 10 3 5 4 X41+X42+X43+X44=1
4 9 13 12 7

Binary variables X11+X21+X31+X41=1

X12+X22+X32+X42=1
Xij = 1, if Team í' is assigned to Project j; Otherwise, this variable will take a value of 0 X13+X23+X33+X43=1
X14+X24+X34+X44=1

1 2 3 4 Row sum
1 0 0 0 1 1 Team 1->Project 3
2 0 1 0 0 1 Team 2-> Project 1
3 1 0 0 0 1 Team 3-> Project 2
4 0 0 1 0 1 Team 4-> Project 4
[Link] 1 1 1 1

Z 39
 Cost Matrix
TOTALLY UNIMODULAR MATRIX
Projects
Team 1 2 3 4 5 6 7
1 92 96 89 75 92 71 82
2 98 91 50 60 58 80 79
3 98 85 91 62 80 70 63
4 64 68 93 74 68 100 87
5 100 50 76 52 62 93 94

1 2 3 4 5 6 7
1 0 0 0 0 0 0 0
2 0 0 0 0 1 0 0
3 0 0 1 0 0 1 1
4 1 0 0 0 0 0 0
5 0 1 0 1 0 0 0
[Link] 1 1 1 1 1 1 1

Z 612 Team 1 should not be assigned to Pro

Team 3 should definitely work for Pro

Cost Matrix Time matrix

8 9 10
56 72 95
78 98 90
51 53 71
92 55 53
69 83 92

8 9 10 row sum
1 0 0 1
0 0 0 1
0 0 0 3
0 1 1 3
0 0 0 2
 1 1 1

hould not be assigned to Project 6

hould definitely work for Project 3

Team 1 2 3 4 5
1 92 96 89 75 92
2 98 91 50 60 58
3 98 85 91 62 80
4 64 68 93 74 68
5 100 50 76 52 62

Team 1-> Project 1 Cost matrix

Team 2-> Project 2 Total cost=92+91+91+74+62
Team 3-> Project 3 Minimize Z = Cij Xij
Team 4-> Project 4
Team 5-> Project 5] Time matrix
Total time=maximum(92,91,91,74,62)
Minimimize Z = Max ()

Cost is ADDITIVE
TIME IS NOT ADDITIVE

Cost Project
Team 1 2 3 4
1 9 4 5 8
2 6 9 8 7
3 10 3 5 4
4 9 13 12 7

Time Project
Team 1 2 3 4
1 8 7 12 5 12
2 11 10 4 6 11
3 4 2 8 9 9
4 12 5 3 6 12

Project
Team 1 2 3 4 row sum
1 0 0 0 1 1
2 0 0 1 0 1
3 1 0 0 0 1
4 0 1 0 0 1
col sum 1 1 1 1

project cost
Z 39
optimisinf function. Total project time

18