Scribd
Upload
93 views2 pages

Sree Vidyanikethan Engineering College: CODE No.:10BT60301

This document contains information about an Operations Research exam for mechanical engineering students at Sree Vidyanikethan Engineering College. It includes 8 questions on topics like linear programming, replacement models, queuing systems, project management, inventory management, decision theory, and game theory. Students are instructed to answer any 5 of the 8 questions in their exam. The questions range from conceptual explanations to numerical problems involving optimization techniques in operations research.

Uploaded by

Soumya Bsoumya
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
93 views2 pages

Sree Vidyanikethan Engineering College: CODE No.:10BT60301

This document contains information about an Operations Research exam for mechanical engineering students at Sree Vidyanikethan Engineering College. It includes 8 questions on topics like linear programming, replacement models, queuing systems, project management, inventory management, decision theory, and game theory. Students are instructed to answer any 5 of the 8 questions in their exam. The questions range from conceptual explanations to numerical problems involving optimization techniques in operations research.

Uploaded by

Soumya Bsoumya
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 No.

:10BT60301

SREE VIDYANIKETHAN ENGINEERING COLLEGE


(An Autonomous Institution, Affiliated to JNTUA, Anantapur)

III B.Tech II Semester (SVEC10) Regular/Supplementary Examinations May - 2015


OPERATIONS RESEARCH
[ Mechanical Engineering ]
Time: 3 hours

Max. Marks: 70
Answer any FIVE questions
All questions carry equal marks

1.

a) State the advantages and limitations of operations research.


b) The manager of an oil refinery must decide on the optimal mix of two possible blending
processes of which the inputs and outputs per production run are as shown in the following table:
Process
Input (units)
Output (units)
Crude A
Crude B
Gasoline A Gasoline B
1
5
3
5
8
2
4
5
4
4
The maximum amount available of crude A and crude B are 200 units and 150 units respectively.
Market requirements show that at least 100 units of Gasoline X and 80 units of Gasoline Y must
be produced. The profits per production run for process 1 and process 2 are Rs. 300 and Rs. 400
respectively. Formulate as linear programming problem and find optimum solution using
graphical method.

2.

A Securable Sales Group wishes to purchase the following quantities of uniforms:


Uniform type:
A
B
C
D
E
Quantity:
150 100 75 250 200
Tenders are submitted by four different manufacturers who undertake to supply not
more than the quantities indicated below.
Manufacturers:
P
Q
R
S
Total Uniform quantity:
300 250 150 200
The group estimates that its profit (in Rs.) per uniform will vary with the
manufacturer as shown in the following table:
A
B
C
D
E
P
27.50 35.00 42.50 22.50 15.00
Q
30.00 32.50 45.00 17.50 10.00
R
25.00 35.00 47.50 20.00 12.50
S
32.50 27.50 40.00 250.00 17.50
How should the order for uniforms be placed.

3.

a) Discuss the various replacement models.


b) The initial cost of an item is Rs. 15,000 and maintenance costs for different years
are given below. What replacement policy should be adopted if the capital is
worth 10% and there is no salvage value.
Year
1
2
3
4
5
6
7
Maintenance Cost (Rs.) 2,500 3,000 4,000 5,000 6,500 8,000 10,000

4.

a) Briefly explain the important characteristics of a Queuing System.


b) A supermarket has a single cashier during the peak hours. Customers arrive at a rate of
20 per hour. The average number of customers that can be processed by the cashier is
24 per hour. Calculate:
a) The probability that the cashier is idle.
b) The average number of customers in the queuing system.
c) The average time a customer spends in the system.
d) The average number of customers in the queue.
e) The average time a customer spends in the queue waiting for service.
1

5.

a) Explain the rules devised by Fulkerson.


b) The time estimates (in weeks) for the activities of a PERT network are given below:
Time(days)
Activity

to

tm

tp

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
3
6
15
Draw the project network and identify all the paths through it. Also determine
i) The expected project length
ii) The standard deviation and variance of the project length
iii) Probability that the project will be completed at least 4 weeks earlier than expected time
iv) The probability of not meeting the due date, if the project due date is 19 weeks.
6.

a) Explain the various costs associated with Inventory of items.


b) Find the optimal order quantity for a product where the annual demand for the product
is 5400 units, the cost of storage per unit per year is 30% of the unit cost and ordering
cost per order is Rs. 600, the unit costs are given below.
Quantity
Unit Cost
0 Q1 2400
Rs. 12.00
2400 Q2 3000
Rs. 10.00
3000 Q3
Rs. 8.00

7.

a) Define Baye's decision rule. Explain various steps involved in the decision theory.
b) A person has two independent investments A and B are available to him, but he can undertake
only one at a time due to certain constraints. He can choose A, first and then stop, or if A is
successful, then take B, or vice versa. The probability of success of A is 0.60, while for B it is
0.4. Both the investments require an initial capital outlay of Rs. 10,000 and both return nothing
if the venture is unsuccessful. Successful completion of A will return Rs. 20,000 and successful
completion of B will return Rs. 24,000. Draw the decision tree and determine the best strategy.

8.

a) What is a Two person zero sum game? Explain the Minimax and Maximin Principles.
b) Using the Dominance property solve the following game whose pay off matrix is given below
Player B
Player A

A1
A2
A3
A4

B1

B2

B3

B4

B5

3
5
8
4

5
6
7
2

4
3
9
8

9
7
8
5

6
8
7
3

You might also like