Download JNTUA MCA 2019 May Reg-Supply 2nd Sem 17F00203 Operations Research Question Paper

FirstRanker.com

MCA II Semester Regular & Supplementary Examinations May/June 2019

OPERATIONS RESEARCH

--- Content provided by‌ FirstRanker.com ---

(For students admitted in 2017 and 2018 only)

Time: 3 hours Max. Marks: 60

Answer all the questions

1. ‘Operations research models enable to conduct a number of experiments involving theoretical subjective manipulations to find some optimum solution to the problem on hand’. Discuss it.

   OR

   --- Content provided by‍ FirstRanker.com ---

   PARLOK Ltd has two products Heaven and Hell. To produce one unit of Heaven, 2 units of material X and 4 units of material Y are required. To produce one unit of Hell, 3 units of material X and 2 units of material Y are required. Only 16 units of material X and 16 units of material Y are available. Material X cost Rs.2.50 per unit and material Y cost Rs.0.25 per unit respectively.

2. Find the optimum transportation cost the following transportation problem:

   	D1	D2	D3	D4	Availability
   S1	2	3	2	5	40
   S2	4	4	3	2	60
   S3	5	3	6	10	40
   Requirement	30	50	40	20

   OR

   Given a set of locations and possible roads to be built between pairs of cities with the associated costs, determine the minimum cost road network connecting all the locations (Apply minimum spanning tree algorithm)

   --- Content provided by‍ FirstRanker.com ---

3. Distinguish between simplex and revised simplex algorithm in detail.

4. Discuss the importance of parametric linear programming.

   OR

   --- Content provided by⁠ FirstRanker.com ---

   Solve, using the cutting-plane algorithm. Illustrate the cuts on a graph of the feasible region.

   Max z = 5x + 8y

   Subject to: x + y < 6, 5x + 9y < 45

   x, y = 0 and integer.

--- Content provided by⁠ FirstRanker.com ---

5. Discuss the significance of simulated annealing algorithm in detail.

   OR

   Enumerate the applications of metaheuristics to integer liner programs.

6. Solve the following LPP by dynamic programming:

   --- Content provided by⁠ FirstRanker.com ---

   Maximize Z = 2x + 3y

   Subject to x — y < 1

   x + y < 3

   x, y = 0

   OR

   --- Content provided by FirstRanker.com ---

   Explain travelling salesperson problem algorithm with suitable example.

FirstRanker.com