Download JNTUH MCA 2nd Sem R15 2018 January 821AJ Operations Research Question Paper

FirstRanker.com

Firstranker's choice

Code No: 821AJ

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

OPERATIONS RESEARCH

Time: 3 Hours

Note: This question paper contains two parts A and B.

Part A is compulsory which carries 25 marks. Answer all questions in Part A.

Part B consists of 5 Units. Answer any one full question from each unit. Each question carries 10 marks and may have a, b, c as sub questions.

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

Max. Marks: 75

5 x 5 Marks =25

5 x 10 Marks =50

PART - A

1. Explain the limitations of Operations Research.

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

2. Give and explain Mathematical model of “Assignment problem”.
3. Explain the usefulness of sequencing modes.
4. What is dynamic programming approach? Explain.
5. What is EOQ(Economic order quantity)? What is its significance?

PART -B

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

1. Using two phase method solve the LPP:

   Miximize p=2x₁+4x₂ +3x₃

   s.t. 3x₁ +4x₂ +3x₃ < 3600

   2x₁ + x₂ + 3x₃ < 2400

   X₁ +3x₂ +3x₃ < 4800 and

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

   x₁=0,x₂=0,x₃=0

   Explain the concept of unbound-solution.

   OR

   With the Big-M method

   Maximize z=3x₁-x₂

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

   S.t. 2x₁ +x₂ = 2

   x₁ +3x₂=3

   x₁ = 4 and

   x₁,x₂=0

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

2. Find the Initial Basic Feasible solution of the Transportation problem where cost matrix is given below

   	A	B	C	D	Supply
   I	1	5	3	3	34
   II	3	3	1	2	15
   III	0	2	2	3	12
   IV	2	7	2	4	19
   Demand	21	25	17	17

   OR

3. Explain Hungarian method for optimal solution through an example.

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

4. There are 4 jobs each of which has to go through the machines M₁, M₂, M₃, M₄, M₅, and M₆, in order Processing Times are as given below.

   Machine	M1	M2	M3	M4	M5	M6
   A	20	10	9	4	12	27
   B	19	8	11	8	10	21
   C	13	7	10	7	9	17
   D	22	6	5	6	10	14

   Determine a sequence of these four jobs which minimizes the total elapsed time T.

   OR

   Illustrate any two Replacement models with numerical examples.

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

5. Solve using dynamic programming approach.

   Maximize z=8x₁+7x₂

   St. 2x₁+x₂=8

   5x₁+2x₂ =15 and

   X₁, X₂ =0

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

   OR

   Explain minimax method of optimal strategies.

6. Explain the term competitive games, saddle point, value of the game with examples. [5+5]

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

7. Explain an inventory model where demand rate is uniform and production rate is uniform. Illustrate your answer with a numerical example.

   OR

   Explain the following Models

   a) {(M/M/1): (8/ FCFS)}

   b) {(M/M/1): (N/FCFS)}

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

   Illustrate your answers with numerical examples. [5+5]

FirstRanker.com