GAYATRI VIDYA PARISHAD COLLEGE FOR DEGREE & P.G COURSES
(A)
III Year B.Sc. (STATISTICS)
Semester – V, STATISTICS : MODEL PAPER
Paper-VII(A): Operation Research 2
(With
effect from 2020-21)
Date: Max.
Marks: 75
TIME:
SECTION-A
I. Answer the following questions 5× 10 = 50 M
1. (a). Find
an Initial Basic Feasible Solution to the Following Transportation Problem
Using
VAM Method
Warehouses
|
FACTORIES |
W₁ |
W₂, |
W₃ |
W₄ |
SUPPLY |
|
F₁ |
4 |
5 |
4 |
7 |
30 |
|
F₂ |
6 |
6 |
5 |
4 |
50 |
|
F₃ |
7 |
5 |
8 |
12 |
20 |
|
DEMAND |
20 |
40 |
30 |
10 |
|
(OR)
(b). Determine the Optimal Solution
by MODI Method for The Following
Transportation Problem.
DESTINATIONS
|
PLANT |
D₁ |
D₂ |
D₃ |
D₄ |
SUPPLY |
|
P₁ |
19 |
30 |
50 |
12 |
7 |
|
P₂ |
70 |
30 |
40 |
60 |
10 |
|
P₃ |
40 |
10 |
60 |
20 |
18 |
|
DEMAND |
5 |
8 |
7 |
15 |
|
2. (a). Solve the Following Assignment Problem
by Hungarian method.
MEN
|
JOBS |
I |
II |
III |
IV |
|
1 |
8 |
26 |
17 |
11 |
|
2 |
12 |
28 |
4 |
26 |
|
3 |
38 |
19 |
18 |
15 |
|
4 |
19 |
26 |
24 |
10 |
(OR)
(b). Explain the procedure for Hungarian
method.
3.
(a). Explain the
procedure for johnson algorithm.
(OR)
(b) We have five jobs, each of which
must go through the machines A,B and C in the
order ABC. Determine the
sequence that will minimize the total elapsed time.
|
Job No. |
1 |
2 |
3 |
4 |
5 |
|
Machine A |
5 |
7 |
6 |
9 |
5 |
|
Machine B |
2 |
4 |
4 |
5 |
3 |
|
Machine c |
3 |
7 |
5 |
6 |
7 |
4. (a) A small maintenance project consists of the
following jobs, whose
precedence relationships given
below.
|
job |
1-2 |
1-3 |
2-3 |
2-5 |
3-4 |
3-6 |
4-5 |
4-6 |
5-6 |
6-7 |
|
Duration (days) |
15 |
15 |
3 |
5 |
8 |
12 |
1 |
14 |
3 |
14 |
(OR)
(b) Explain
the procedure for PERT( Program Evaluation and Review Technique)
5. (a)
(OR)
(b)
SECTION-B
II. Answer the following five
questions. 5×3=15M
6. Explain the procedure for North West Corner rule
method.
7. Explain the degeneracy in Transportation problem..
8. Explain the procedure for travelling sales man problem..
9. Explain Maximization case in Assignment problem.
10. Explain the procedure for n jobs three machines.
11. Explain Rules of Networking
construction..
12.
13.
SECTION-C
III. Answer all the following questions. 5×2=10M
14. Define Transportation problem
15. Define Unbalanced assignment problem.
16. Define No passing rule.
17. Define Scheduling.
18. .
