D DC201 Pages: 3

Reg No.: Name:

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
SECOND SEMESTER MCA DEGREE EXAMINATION, APRIL 2018

Course Code: RLMCA 108
Course Name: OPERATIONS RESEARCH

Max. Marks: 60 Duration: 3 Hours
PART A
Answer all questions, each carries 3 marks. Marks
1 Explain the use of artificial variables in solving a linear programming problem (3)
2 What is meant by duality in linear programming problems. Write the (3)
fundamental principle of duality
3 Describe the Matrix Minima method. (3)
4 Explain (i) Saddle point (11) Two person zero sum game (3)
5 Explain single server Poisson queuing model with infinite capacity. (3)
6 Explain pure birth and death process (3)
7 What you mean by simulation? Explain. (3)
8 Write the steps for generating random numbers. (3)

PART B
Each question carries 6 marks.

9 a) A company produces two articles A and 8. There are two different (6) departments
through which the articles are processed such as assembly and finishing. The potential
capacity of the assembly department is 60 hours per week and that of the finishing
department is 48 hour per week. The production of one unit of A requires 4 hours in
assembly and 2 hours in finishing. Each of the unit B requires 2 hours in assembly and 4
hours in finishing. If profits in Rs. 8 for each unit of A and Rs. 6 for each unit of B, find
out the number of units of A and B to be produced each week to get the maximum profit.
Use graphical method.

OR

b) Solve the following LPP :- (6)
Maximise Z = xX1+X2+X3
Subject to 4x14+5x2+3x3 55
10x1+7x2+x3 > 12; x1, x2,x3 20
10 a) (1) Write the dual of the following LPP:- (6)
Maximise Z = xX1+X2+X3
Subject to 4x14+5x2t+3x3 > 15
10xX1+7x2+x3 > 12; x1, 32.33 20

(ii) State the complementary slackness theorem.

Page 1 of 3