Download JNTUH (Jawaharlal nehru technological university) MCA (Master of Computer Applications) 2nd Sem (Second Semester) Regulation-R15 2018 January 821AJ Operations Research Previous Question Paper
R15
Code No: 821AJ
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
MCA II Semester Examinations, January - 2018
OPERATIONS RESEARCH
Time: 3 Hours
Max. Marks: 75
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.
PART - A
5 ? 5 Marks = 25
1.a) Explain the limitations of operations Research.
[5]
b) Give and explain Mathematical model of "Assignment problem".
[5]
c) Explain the usefulness of sequencing modes.
[5]
d) What is dynamic programming approach? Explain.
[5]
e) What is EOQ(Economic order quantity)? What is its significance?
[5]
PART - B
5 ? 10 Marks = 50
2.a)
Using two phase method solve the LPP:
Miximize
p 2x 4x 3x
1
2
3
.
s t. 3x 4x 3x 3600
1
2
3
2x x 3x 2400
1
2
3
x 3x 3x 4800 and
1
2
3
x 0, x 0, x 0
1
2
3
b)
Explain the concept of unbound solution.
[5+5]
OR
3.
With the Big-M method
[10]
Maximize
z 3x x
1
2
.
s t. 2x x 2
1
2
x 3x 3
1
2
x 4 and
2
x , x 0
1
2
4.
Find the Initial Basic Feasible solution of the Transportation problem where cost
matrix is given below
[10]
Destination
Supply
A
B
C
D
I
1
5
3
3
34
II
3
3
1
2
15
origin
III
0
2
2
3
12
IV
2
7
2
4
19
Demand
21
25
17
17
OR
5.
Explain Hungarian method for optimal solution through an example.
[10]
6.
There are 4 jobs each of which has to go through the machines M1, M2, M3, M4,
M5, and M6, 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
Job
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.
[10]
OR
7.
Illustrate any two Replacement models with numerical examples.
[10]
8.
Solve using dynamic programming approach.
Maximize
z 8x 7x
1
2
.
s t. 2x x 8
1
2
5x 2x 15 and
1
2
x , x 0
1
2
[10]
OR
9.a)
Explain minimax method of optimal strategies.
b)
Explain the term competitive games, saddle point, value of the game with
examples.
[5+5]
10.
Explain an inventory model where demand rate is uniform and production rate is
uniform. Illustrate your answer with a numerical example.
[10]
OR
11.
Explain the following Models
a)
M M 1: FCFS
b)
M M 1:N FCFS
Illustrate your answers with numerical examples.
[5+5]
---oo0oo---
This post was last modified on 17 March 2023