wk12

(6 pages)

NOVEMBER 2017 1705130/UMSM55A

Time : Three hours Maximum : 75 marks

SECTION A — (10  2 = 20 marks)

Answer any TEN questions.

Each question carries 2 marks.

1. Give any two applications of operations research.

2. What is meant by slack variable?

3. Give any two properties of duality.

4. What is meant by dual simplex method?

5. What is meant by Rim conditions in

transportation problem?

6. What is meant by prohibited assignment problem?

7. What is meant by payoff matrix in Game theory?

8. What is meant by pausing in a sequencing

problems?

9. What is meant by critical activity?

 wk12

10. What is meant by PERT in the network analysis?

11. What is meant by Two person sum game?

12. Give role of computers in an Operations Research.

SECTION B — (5  5 = 25 marks)

Answer any FIVE questions.

Each question carries 5 marks.

13. Solve graphically :

Maximize Z  20x  30 y

Subject to the constraints :

3x  3 y  36
5x  2 y  50
2x  6 y  60
with x , y  0 .

14. Using duality solve the following LPP :

Maximize Z  32x  12 y

Subject to the constraints :

4x  3y  6
8x  2 y  5
with x , y  0 .

2 1705130/UMSM55A
 wk12

15. Find the initial transportation cost for the

following using Vogel’s approximation method :
Destination
P Q R S Supply
A 18 30 50 11 7
Source B 70 30 40 60 9
C 41 8 70 20 18
Demand 5 8 7 14

16. Solve the following sequencing problem giving an

optimal solution if passing is not allowed :
Machines
L M N O
A 14 5 6 16
Jobs B 12 4 10 12
C 16 2 4 16
D 16 3 4 20

17. Solve the following game using dominance rule :

 8 10 9 14
10 11 8 12 .
 
13 12 14 13

3 1705130/UMSM55A
 wk12

18. Draw network and determine the critical path for

the given data :
Jobs 1-2 1-3 2-3 2-4 3-4 4-5
Duration 20 25 10 12 6 10

19. Using graphical method, solve the rectangular

game whose payoff matrix for player A is
 6 7 
 
 4  5
  1  2 .
 
 2 5 
 7  6
 

SECTION C — (3  10 = 30 marks)

Answer any THREE questions.

Each question carries 10 marks.

20. Using Simplex method solve :

Max. Z  21x1  15x2

Subject to the constraints :

x1  2x2  6
4 x1  3x2  12
with x1 , x 2  0 .

4 1705130/UMSM55A
[P.T.O.]
 wk12

21. Using Two-Phase method solve the LPP :

Max. Z  3x1  x 2  2x3
Subject to the constraints :
x1  3x2  x3  5
2x1  x2  x3  2
4 x1  3x 2  2x3  5
with x1 , x2 , x3  0 .

22. Solve the following assignment problem :

To
1 2 3 4 5
1 12 11 4 2 8
From 2 7 11 10 12 14
3 3 6 9 14 12
4 11 15 11 10 7

23. Use the notion of dominance to satisfy the

rectangular game with the following payoff, and
solve it graphically :
Player-B
I II III IV
1 18 4 6 4
Player-A 2 6 2 13 7
3 11 5 17 3
4 7 6 12 2

5 1705130/UMSM55A
 wk12

24. A project consists of the following activities and

time estimates :
Activity Least time Most likely Greatest
(days) time (days) time (days)
1-2 4 3 6
2-3 1 2 3
2-4 4 3 6
3-5 3 4 5
4-5 2 3 4
4-6 3 5 7
5-7 4 5 6
6-7 6 7 8
7-8 2 4 6
7-9 2 2 4
8-10 4 6 8
9-10 3 5 7
(a) Draw network diagram.
(b) Find the expected duration and variance for
each activity and
(c) Project duration.

———————

6 1705130/UMSM55A