Scribd
Upload
50 views4 pages

Management Programme Term-End Examination June, 2011 Ms-51: Operations Research

This document is a 4 page exam for an Operations Research management program. It contains 6 questions testing various OR techniques: 1) Discuss the history and applications of OR, and solve a linear programming problem graphically. 2) Calculate the economic order quantity, number of orders per year, time between orders, and optimal cost for an inventory problem. 3) Formulate a resource allocation problem as a transportation problem to find the maximum billing amount. 4) Explain the dominance principle in game theory and simulate demand using random numbers. 5) Discuss queuing parameters and calculate characteristics of a Poisson arrival and exponential service queuing system. 6) Write short notes on 4 OR

Uploaded by

siva
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
50 views4 pages

Management Programme Term-End Examination June, 2011 Ms-51: Operations Research

This document is a 4 page exam for an Operations Research management program. It contains 6 questions testing various OR techniques: 1) Discuss the history and applications of OR, and solve a linear programming problem graphically. 2) Calculate the economic order quantity, number of orders per year, time between orders, and optimal cost for an inventory problem. 3) Formulate a resource allocation problem as a transportation problem to find the maximum billing amount. 4) Explain the dominance principle in game theory and simulate demand using random numbers. 5) Discuss queuing parameters and calculate characteristics of a Poisson arrival and exponential service queuing system. 6) Write short notes on 4 OR

Uploaded by

siva
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/ 4

No.

of Printed Pages :4
r -511
MANAGEMENT PROGRAMME

Term-End Examination
June, 2011

MS-51 : OPERATIONS RESEARCH

Time : .3 hours Maximum Marks : 100


(Weigh tage 70%)

Note : Answer any FOUR questions. All questions carry equal


marks.

1. (a) Discuss the historical background of


Operations Research (O.R). Explain its
significance and scope in Management
Des ci s ion Ma king. Enumerate the
limitations of O.R.
(b) Solve the following Linear Programming
Problem graphically.
Maximize 7 = 4x1 + 6x2
Subject to constraints
+x =5
x1 _>2

x? >0

MS-51 1
1 T'e bo.iiiomic Batch
Quantity (1.11Q)loi simuitaileous
and consumption.
The annual demand for an item is
7200 units. The unit cost is R ;')/- ,lid
inventory currying cost is 25% per annum.
If the cost of one procurement is Rs 150/-,
find Out
(i) Economic Order Quantity
(ii) No. of orders per year
(iii) Time between two consecutive orders
(iv) The optimal cost
Mention assumptions made, if any.

Discuss the application of dynamic


programming in decision making. !low is
this different from linear programming ?
An organization has three consultants.
Each consultant can work upto 160 hours
during next month during which three
projects roust be completed. Project 1 will
take 130 hours, Project 2 will take 140 hours
and Project 3 will take 160 hours. The
amount (l's.) per hour that can be billed for
assigning each consultant to each project is
given below
Project
Consultant
t 2 T 3
1200 1500 . 1900
-
1400 1300 1200_,
3 1600 ti 40011500

MS-51 2
Formulate this as a transporation
and find the optirnal solution. li'Vhat is the
maximum total billing for next month

4. (a) Explain the meaning of Dominance


Principle in Game Theory. Illustrate with a
small example.
(b) A bakery keeps stock of a popular brand of
cakes. Previous experience shows the daily
pattern for the item with associated
probabilities as given :

Daily Demand
0 10 20 30 40 50
(Nos)
Probability 0.1 0.2 0.15 0.5 0.02 0.03

Use the following sequence of rancour


numbers to simulate the demand for next
10 days. Also find the average demand per
day. Random Nos. 25, 39, 65, 76, 12, 05,
73, 89, 19, 49.

5. (a) Discuss the parameters of Queuing Problem.


(b) A self - service store employs one cashier at
its counter. Nine customers arrive on an
average every 5 minutes while the cashier
can serve 10 customers in 5 minutes.
Assuming Poisson distribution for arrival
rate and exponential distribution for service
rate, find

MS-51 3 P.T.O.
(i) Average number of customers in the
system.
(ii) Average number of customers in
queue or average queue length.
(iii) Average time a customer spends in the
system.
(iv) Average time a customer waits before
being served.

6. Write short notes on any four of the following :


(a) Branch and bound algorithm
(b) Goal Programming
(c) Non - linear Programming
(d) Assignment Problem
(e) Dual Linear Programming Problem
(f) Travelling salesman problem

MS-51 4

You might also like