Assignment – Problems : Operations Research(MA30004)

Spring 2020 : Course Teacher: Prof. M. P. Biswal

No.1: Solve the following Transportation Problems:
Find the Phase-I solution by NWCR . Then obtain the Phase-II solution by
MODI method.
(a)
To Destination Amount
From Available
3 7 6 4 50
Source 2 4 3 2 20
4 3 8 5 30
Amount 30 30 20 20 -------
Required
(b)

To Destination Supply
From
5 6 4 2 10
Source 2 10 1 3 20
3 4 2 1 20
2 1 3 2 10
Demand 20 10 10 20

(c)
To Destination Supply
From
8 6 3 7 5 20
Source 5 9 8 4 7 30
6 3 9 6 8 30
0 0 0 0 0 20
Demand 25 25 20 10 20
(d)
To Destination Supply
From
6 3 5 40
Source 4 8 7 30
3 4 3 20
Demand 40 20 30

1
(e)

To Destination Supply
From
2 4 6 5 7 40
Source 7 6 3 8 4 60
8 7 5 2 5 60
0 0 0 0 0 40
Demand 40 40 20 50 50

(f)
To Destination Amount
From Available
2 3 4 9 20
Source 14 12 5 1 30
12 15 9 3 50
Amount 10 10 20 50 -------
Required

(g)
To Destination Amount
From Available
8 6 4 2 40
Source 10 6 6 2 30
4 2 3 8 60
Amount 30 30 30 40 -------
Required

(h)
To Destination Supply
From
5 6 7 8 130
Source 5 5 6 7 150
4 7 6 7 150
9 6 8 6 130
Demand 100 160 200 100

2
No.2. Solve the following Assignment Problems by Hungarian Method.
(a)
M1 M2 M3 M4
Job1 2 10 3 17
Job2 5 3 9 10
Job3 8 2 5 14
Job4 3 5 10 16
(b)
M1 M2 M3 M4 M5
Job1 2 3 5 1 4
Job2 -1 1 3 6 2
Job3 -2 4 3 5 0
Job4 1 3 4 1 4
Job5 7 1 2 1 2
(c)
M1 M2 M3 M4 M5
Job1 2 8 4 -1 3
Job2 1 5 4 4 8
Job3 0 2 5 1 5
Job4 4 1 3 2 5
Job5 6 2 5 2 5

(d)
M1 M2 M3 M4
Job1 2 3 0 4
Job2 0 1 4 0
Job3 0 0 2 4
Job4 1 0 2 1
(e)
M1 M2 M3 M4
Job1 50 55 42 57
Job2 66 70 60 68
Job3 40 42 38 45
Job4 81 78 72 80

3
No.3 Solve the following Two- person zero-sum game:

(a)
B B
10 -20 12 -5 2 0 7
A -20 40 -10 A 5 6 4 8
10 -22 10 4 0 2 -3
(b) Solve the following 2x2 unstable game:

B
B
A -5 10
A -10 5
20 -5
5 -20
(c ) Solve the following unstable matrix games by LP method:

B B
20 -30 40 6 -6 12
A -30 40 -50 A -6 12 -10
40 -50 60 12 -10 18

(d) Solve the following games by LP method:

B
-2 5
-5 3
A 0 -2
-3 0
1 -4
B
A 2 2 3 4
4 3 2 2

4
(e) Apply the method of Dominance to solve the following unstable games:

B
3 2 4 0
A 3 4 2 4
4 2 4 0
0 4 0 8

(g)
A
3 5 8 4
B 5 6 7 2
4 3 9 8
( Hints: Take the transpose of the matrix )

(h) Solve the following matrix game by any suitable method:

(i)
B
1 -1 -1
A -1 2 -1
-1 -1 3

B
-1 -1 -1 2
A -1 -1 2 -1
-1 3 -1 -1
4 -1 -1 -1

No.4 Solve the following IPP by Branch & Bound method

or Cutting Plane method:
(a) Max : Z = 4 X 1 + 3 X 2
Subject to 2X1 + X 2 ≤ 6
2 X 1 + 3X 2 ≤ 9
X 1 , X 2 = 0,1,2,....

5
(b) Max : Z = 2 X 1 + X 2
Subject to 2 X 1 + 5 X 2 ≤ 17
3 X 1 + 2 X 2 ≤ 10
X 1 , X 2 = 0,1,2,....
(c ) Max : Z = 7 X 1 + 9 X 2
Subject to − X 1 + 3X 2 ≤ 6
7 X 1 + X 2 ≤ 35
X 1 , X 2 = 0,1,2,....
(d ) Max : Z = 5 X 1 + X 2
Subject to − X1 + 2X 2 ≤ 4
X1 − X 2 ≤ 1
4 X 1 + X 2 ≤ 12
X 1 , X 2 = 0,1,2,....

(e ) Max : Z = X 1 + X 2
Subject to 2X1 + X 2 ≤ 6
4 X 1 + 5 X 2 ≤ 20
X 1 , X 2 = 0,1,2,....

(f ) Min : Z = X 1 + X 2
Subject to 2X1 + 2X 2 ≥ 5
12 X 1 + 5 X 2 ≤ 30
X 1 , X 2 = 0,1,2,....

(g ) Min : Z = X 1 + 4 X 2
Subject to X1 + 2X 2 ≥ 6
2X1 + X 2 ≤ 8
X1 ≤ 3
X 1 , X 2 = 0,1,2,....

Q5. Solve the following LPP by Primal /Dual simplex method:

(a)
Min : Z = 5 X 1 + 2 X 2 + 3 X 3
Subject to X 1 + 2 X 2 − X 3 ≥ 15
2 X 1 + X 2 + X 3 ≥ 12
X1, X 2 , X 3 ≥ 0

6
(b) Max : Z = 3 X 1 + 6 X 2
Subject to X1 + 2X 2 ≥ 6
3X 1 + X 2 ≥ 9
7 X 1 + 5 X 2 ≤ 35
X1, X 2 ≥ 0
(c)
Max : Z = − X 1 − 4 X 2 − 3 X 3
Subject to 2 X 1 + X 2 + 3X 3 ≥ 4
X1 + 2X 2 + 2X 3 ≥ 3
X1, X 2 , X 3 ≥ 0
(d) Max : Z = 20 X 1 + 24 X 2
Subject to 2 X 1 + X 2 ≤ 24
2 X 1 + 3 X 2 ≤ 48
X 1 + X 2 ≤ 20
− 2 X 1 + 3X 2 ≥ 0
X1, X 2 ≥ 0
(e)
Max : Z = X 1 − 4 X 2 + X 3
Subject to 2 X 1 + X 2 + 3 X 3 = 10
− 3 X 2 + X 3 = −4
X1 + X 3 = 3
X1, X 2 , X 3 ≥ 0

No.6 Solve all the above LP problems (i) by Two-Phase simplex method
(ii) Big-M method.

No.7 Solve all the LP problems by Revised Simplex Method

by dropping the Integer restrictions.
( Submission of Assignment is Optional )