8

394787

6
C 43147 (Pages : 4) Name.........................................

Reg. No.....................................

3
SECOND SEMESTER (CBCSS—UG) DEGREE EXAMINATION
APRIL 2023

1
B.C.A.

BCA 2C 04—OPERATIONS RESEARCH

(2019—2022 Admissions)

Time : Two Hours Maximum : 60 Marks

Section A (Short Answer Type Questions)

8
Answer all questions.
Each question carries 2 marks.
Ceiling 20 marks.

6
1. Define Operations Research ?

2. Write any two applications of OR.

3
3. What is Surplus variable ?

4. What are the basic assumptions of LPP ?

1
5. What do you mean by Transhipment Problem ?

6. What do you mean by basic feasible solution of a Transportation problem ?

7. Define Travelling salesman problem.

8. Write down mathematical formulation of assignment problem.

9. Define total float, free float and independent float.

8
10. What is sequencing problem ?

11. Define no passing rule on sequencing problem.

6
12. Define Degeneracy in Transportation problem.

1 3
394787
Turn over
 8
394787

6
2 C 43147

Section B (Short Essay Type Questions)

3
Answer all questions.
Each question carries 5 marks.

1
Ceiling 30 marks.

13. Explain the role of operation research in decision-making.

14. Solve the following LPP by Graphically :

Maximize Z = X1 + 3X 2
subject to constraints

8
X1 + 2X 2 ≤ 9
X1 − X 2 ≥ 2
X1 + 4X 2 ≤ 11

6
X1 , X 2 ≥ 0.

3
15. Solve LPP using simplex method :

Maximize Z = 2X1 + 3X 2

1
subject to constraints
X1 + 2X 2 ≤ 6
2X1 + X 2 ≤ 8
X 1 , X 2 ≥ 0.

16. Obtain Initial basic feasible solution of the following Transportation problem using North West
Corner rule :

8
D1 D2 D3 D4 Supply

S1 1 2 1 4 30

6
S2 3 3 2 1 50

S3 4 2 5 9 20

3
Demand 20 40 30 10

1
394787
 8
394787

6
3 C 43147

17. Find the initial solution of the following Transportation Problem by using Least Cost Method :

3
D1 D2 D3 Supply

O1 2 7 4 5

1
O2 3 3 1 8

O3 5 4 7 7

O4 1 6 2 14

Demand 7 9 18

18. Solve the following assignment problem :

8
1 2 3 4 5

A 8 4 2 6 1

6
B 0 9 5 5 4

C 3 8 9 2 6

3
D 4 3 1 0 3

E 9 5 8 9 5

1
19. Compare PERT and CPM.

Section C (Essay Type Questions)

Answer any one question.

20. Solve LPP using simplex method :

8
Maximize Z = 2X1 + 3X 2

6
subject to constraints
X1 + X 2 ≤ 4
− X1 + X 2 ≤ 1

3
X1 + 2X 2 ≤ 5
X1 , X 2 ≥ 0.

1
Turn over

394787
 8
394787

6
4 C 43147

21. Solve the following transportation problem and determine optimal allocation :

3
D1 D2 D3 D4 Supply

S1 21 16 25 13 11

1
S2 17 18 14 23 13

S3 32 27 18 41 19

Demand 6 10 12 15

(1 × 10 = 10 marks)

3 6 8
1
3 68
1
394787