D

Reg. No. Name:

C2D001 Pages: 3

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY SECOND SEMESTER MCA

DEGREE EXAMINATION, AUG 2017 RLMCA108: OPERATIONS RESEARCH

Max. Marks: 60. Duration: 3 Hours

13.

PART A
Answer all questions. Three marks each.
Define: Basic solution and Feasible solution
Solve graphically the LPP
Maximise = 4+ 6 subject to+< 10, 3 + > 15 Where 20,20

. Find an initial basic feasible solution by North West corner method.

D E F G Availability
| 11 || 13 | 17 14 A 250
| _ 16 18 | 14 10 B 300

Demand 200 225 275 250

State the Maximin — Minimax principle.
Write symbolic representations of a queuing model and mention the meaning of each
symbol.
What are the steps in the methodology of simulation?
State the Fundamental theorem of duality
How do simulated sampling method (Monte-Carlo method) used to evaluate the value of x?
PART B
Answer one question from each module. Six marks each.
MODULE I
Suppose that you are investing Rs. 1,00,000/- in a combination of two shares A and B . The
maximum investment allowed in either share is Rs. 75,000/-. Share A has an average rate of
return of 10% and risk 40% whereas Share B has an average rate of return of 20% and risk
90%. You are not ready to accept rate of return below 12% and risk above 60%. Formulate
this as a LPP and solve it graphically.

. Use simplex method to solve the LPP =4 +10 subject to the constraints
2 + $50, 2 +5 4100, 2 +3 590 A 20 20
MODULE II
. Write the dual of the LPP and solve it. =15 +10 subject to (€
constraints 3 +5 25, 5-2 23,10 20 20

. Prove that the dual of the dual is the Primal problem.

MODULE III

Use Vogel’s approximation method to obtain an IBFS of the transportation problem :

Page 1 of 3