Firstranker's choice
Code No: 821AJ
--- Content provided by FirstRanker.com ---
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
MCA I Semester Examinations, December - 2019
OPERATIONS RESEARCH
Time: 3hrs Max.Marks:75
Note: This question paper contains two parts A and B.
--- Content provided by FirstRanker.com ---
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.
PART - A 5 x 5 Marks =25
- State the various types of OR models according to structure. [5]
- State the variants of assignment problem. How are they resolved? [5]
- State and explain Johnson’s algorithm for n jobs and two machine problems. [5]
- State and explain Bellman’s principle of optimality. [5]
- State the functions of inventory. [5]
--- Content provided by FirstRanker.com ---
PART -B 5 x 10 Marks = 50
-
Define OR. State and explain various phases of OR.
--- Content provided by FirstRanker.com ---
Solve the following LPP by using the graphical- method. [4+6]
Minimize Z = 6x1 +4x2
st 2x1 +3x2 = 30
3x1 +2x2 = 24
x1, x2 = 3, x1 = 0 ?i
--- Content provided by FirstRanker.com ---
OR
Solve the following LPP problem by two-phase method
Max Z = 4x1 +3x2 +5x3
st x1+3x2+2x3 = 10
2x1+2x2 +x3 = 6
--- Content provided by FirstRanker.com ---
x1+2x2+3x3 = 14, X? = 0 ?i [10]
-
A company has three factories I, II, III and four warehouses 1, 2, 3, 4. The transportation cost (in Rs.) per unit from each factory to each ware house is given in table. The requirements of each warehouse and the capacity of each factory are given below.
1 2 3 4 Availability I 25 17 25 14 400 II 15 10 18 24 600 III 16 20 8 13 600 Requirement 300 300 500 500 Find the minimum cost of transportation schedule. Use Vogel’s method for finding the initial basic feasible solution. [10]
OR
--- Content provided by FirstRanker.com ---
-
Give the following across city distance table, find the minimum distance root provided his home town is A. [10]
From A B C D E A 0 7 6 8 4 B 7 0 8 5 3 C 6 8 0 9 7 D 8 5 9 0 8 E 4 6 7 8 0 -
Two jobs are to be processed on four machines A, B, C and D. The technological order for these jobs on machines is as follows:
Job 1 A B C D
--- Content provided by FirstRanker.com ---
Job 2 D B A C
Processing times are given in the following table:
Machines A B C D Job 1 4 6 7 3 Job 2 4 7 5 8 Solve it by graphical method. [10]
OR
A manufacturer is offered two machines A and B. Machine A is priced at Rs.5000 and its running costs are estimated at Rs.800 for each of the first five years increasing by Rs.200 per year in the sixth and subsequent years. Machine B that has the same capacity as A costs Rs.2500 but would have running costs Rs.1200 per year for six years, increasing by Rs.200 per year thereafter. If money is worth 10% per year, which machine should be purchased? [10]
--- Content provided by FirstRanker.com ---
-
A company has to transport some goods from city A to city J. The cost of transportation between the different cities is given in the following network. Find the optimal route connecting cities A and J. [10]
B C D E F G H I J A 5 4 B 4 3 C 2 6 D 7 E 3 6 F 1 9 G 7 H 3 I 8 OR
-
Explain the terms i) Payoff matrix ii) saddle point iii) value of the game.
--- Content provided by FirstRanker.com ---
Solve the following game graphically where pay off matrix for player A has been prepared.
8 -6 7 4 -7 6 4 2 [5+5]
-
Beta industry estimates that it will sell 24000 units of its product for the forthcoming year. The ordering cost is Rs.150 per order and carrying cost per unit per year is 20% of the purchase price per unit. The purchase price per unit is Rs.50. Find:
- Economic Order Quantity
- No. of orders per year
- Time between successive orders.
--- Content provided by FirstRanker.com ---
-
Derive the formula for economic ordering quantity by clearly stating the assumptions of it and use it. [10]
OR
--- Content provided by FirstRanker.com ---
- Explain about Kendal notations used in queuing theory.
- In a railway yard goods train arrive at a rate of 30 trains/day. Assuming that the inter arrival time follows an exponential distribution and service time distribution is also exponential with an average 36 minutes. Calculate the following:
- The average number of trains in the queue.
- The average waiting of a train in the system.
- The probability that the number of trains in the system exceeds 10. [4+6]
--- Content provided by FirstRanker.com ---
---00000---
--- Content provided by FirstRanker.com ---
This download link is referred from the post: JNTUH MCA 2nd Sem Last 10 Years 2023-2013 Question Papers R20-R09 || Jawaharlal nehru technological university