Scribd
Upload
81 views2 pages

SS 15A03601 Operations Research

This document contains an exam for Operations Research from June/July 2019. It includes 10 short answer questions worth 2 marks each (Part A) and 5 longer questions worth 10 marks each (Part B) covering various topics in operations research including linear programming, duality, assignment problems, queuing models, PERT/CPM, game theory, and dynamic programming. Sample problems are provided for each topic that students would solve to demonstrate their understanding. The exam tests both basic concepts and mathematical problem solving abilities in operations research.

Uploaded by

Raj Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
81 views2 pages

SS 15A03601 Operations Research

This document contains an exam for Operations Research from June/July 2019. It includes 10 short answer questions worth 2 marks each (Part A) and 5 longer questions worth 10 marks each (Part B) covering various topics in operations research including linear programming, duality, assignment problems, queuing models, PERT/CPM, game theory, and dynamic programming. Sample problems are provided for each topic that students would solve to demonstrate their understanding. The exam tests both basic concepts and mathematical problem solving abilities in operations research.

Uploaded by

Raj Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Code: 15A03601 SS

B.Tech IV Year I Semester (R15) Supplementary Examinations June/July 2019


OPERATIONS RESEARCH
(Mechanical Engineering)
Time: 3 hours Max. Marks: 70
PART – A
(Compulsory Question)
*****
1 Answer the following: (10 X 02 = 20 Marks)
(a) Mention any four applications of operations research.
(b) Define the terms “Tools”, “Techniques” and “Methods”.
(c) Write the steps involved in least cost method.
(d) What is sensitivity in assignment problem?
(e) Define competitive game and payoff matrix.
(f) Write Kendall’s notation for representing queuing models.
(g) What is Gantt chart?
(h) List the applications of PERT/CPM.
(i) State the principle of optimality in dynamic programming.
(j) What is Economic life of an Asset?

PART – B
(Answer all five units, 5 X 10 = 50 Marks)
UNIT – I
2 Solve the following LP problem by Two-Phase method.
𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 5𝑥1 + 8𝑥2
Subjected to the constraints 3𝑥1 + 2𝑥2 ≥ 3
𝑥1 + 4𝑥2 ≥ 4
𝑥1 + 𝑥2 ≤ 5
𝑥1 , 𝑥2 ≥ 0.
OR
3 Solve the following LP problem by using Big M (Penalty) method.
𝑀𝑖𝑛 𝑍 = 2𝑥1 + 9𝑥2 + 𝑥3
𝑥1 + 4𝑥2 + 2𝑥3 > 5
3𝑥1 + 𝑥2 + 2𝑥3 > 4
𝑥1 , 𝑥2 , 𝑥3 ≥ 0.
UNIT – II
4 State the fundamental properties of duality and prove any one of them.
OR
5 Determine an initial basic feasible solution by using Vogel’s approximation method for the following
information.
Destination
1 2 3 4 Supply
1 21 16 15 13 11
Source 2 17 18 14 23 13
3 32 27 18 41 19
Demand 6 10 12 15 43
Contd. in page 2

Page 1 of 2
Code: 15A03601
SS
UNIT – III
6 Solve the game graphically:
Player B
2 2 3 -1
Player A
4 3 2 6
OR
7 A ticket issuing office is being named by a single server. Customers arrive to purchase tickets
according to a Poisson process with a mean rate of 30 per hour. The time required to serve a
customer has an empowered distribution with a mean of 90 seconds. Find the value of 𝑃𝑛 , 𝐿𝑠 and
𝐿𝑠 𝑎𝑛𝑑 𝑊𝑠 denote are expected line length and watching time of the system respectively.
UNIT – IV
8 Find the sequence that minimizes the total elapsed time (in hours) required to complete the following
jobs on three machines M1 , M2 and M3 in the order M1 , M2 , M3 .
Job
A B C D E
M1 5 7 6 9 5
Machine M2 2 1 4 5 3
M3 3 7 5 6 7
OR
9 A small project is completed of 7 activities whose time estimates are listed in the table below.
Activities are identified by their beginning: (i) and ending. (ii) node numbers.
Estimated duration (weeks)
Activity (i-j) Optimistic Most likely Pessimistic
(1- 2) 1 1 7
(1- 3) 1 4 7
(1- 4) 2 2 8
(2- 5) 1 1 1
(3- 5) 2 5 14
(4- 6) 2 5 8
(5- 6) 1 6 15
(i) Draw the project network and identify all paths through it.
(ii) Find expected duration and variance for each activity.
UNIT – V
10 Use dynamic programming technique to solve the following problem.
𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 𝑥1 𝑥2 𝑥3 𝑥4
Subject to 𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 = 12
𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 ≥ 0.
OR
11 A firm is considering replacement of a machine whose cost price is Rs. 12,200 and the scrap value
is Rs. 200. The maintenance costs are found from experience to be as follows:
Year 1 2 3 4 5 6 7 8
Maintenance cost 200 500 800 1200 1800 2500 3200 4000
When should the machine be replaced?

*****

Page 2 of 2

You might also like