Scribd
Upload
21 views2 pages

Compre

Uploaded by

OPM Rocky
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
21 views2 pages

Compre

Uploaded by

OPM Rocky
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

BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, PILANI

HYDERABAD CAMPUS
SECOND SEMESTER 2020-2021
MATH F242: OPERATIONS RESEARCH
COMPREHENSIVE EXAMINATION (OPEN BOOK)
DATE: 22-05-20201 Time: 2 HOURS Max Marks: 40
Set A

1.Write your NAME and ID at the top of every page.


2.Answer all sub-parts of a particular question at the same place.
3. Please write legible.
4. Scan the pages in PDF format, make a single PDF file containing the answers
of all the questions and UPLOAD IN THE RESPECTIVE ASSIGNED CLASSROOM
(and mail me a copy of the same) before 5:15 PM on 22-05-2021.
5. Suppose a student’s ID is 2019B4A71450H, then the file name will be
2019B4A71450.pdf.
6. No marks will be awarded and the answer sheets will not be evaluated for any
violations from the above mentioned instructions.
7. All symbols carry their usual meaning as per the prescribed text book/s.
_____________________________________________________________________

1. Using graphical method obtain the optimal strategies for both players and the value of
the game for two person zero sum game whose payoff [for player A] matrix is given
below (without reducing the size of the payoff matrix using dominance property).
[7 M]
Player B
Player A B1 B2
A1 −1 2
A2 −5 −1
A3 3 1
A4 −2 −7
A5 4 −3

2. A small project is composed of several activities whose time estimates (in weeks) for
each activity are listed in the table below [8 M]
Activity 1−2 1−3 1−4 2−3 2 −5 2 −6 3 −4 3 −6 4−6 4-7 5-6 5-7 6-7
Optimistic 2 2 1 3 6 4 0 3 2 2 5 1 5
Most 2 8 4 6 9 4 0 9 5 8 8 4 8
likely
Pessimistic 14 14 7 9 18 4 0 9 14 14 17 7 17
a) Construct the Project Network.
b) Find the expected time and variance for each activity.
c) Find the critical path. Also, find the expected time for the completion of the project
and variance along the project length. What is the probability that the project will be
completed within 32 weeks?
3. Assume that the demand (𝑋) of a commodity in a single period is a random variable
with the following probability mass function:

𝑋 5 10 15 20 25 30 40
𝑝(𝑥) 0.15 0.20 0.10 0.25 0.10 0.15 0.05

The stock out cost per unit out of stock is Rs 20. The purchase cost is Rs 5 per unit
and the holding cost of ending inventory is Rs 10 per unit. There is an initial
inventory of 10 units. Should the purchase be made if there is no set up cost? How
many units are purchased if the purchase is to be made in order to minimize the
expected total cost (there is no set up cost)? What is the expected total cost if the
purchase is made (there is no set up cost)?
Let K be the set up cost. For what range of K it is advantageous to made purchase?
[7 M]
4. Assume that in a queueing system with one server, FCFS queue discipline, unlimited
queue length, unlimited input source, the inter arrival time (X) is given by
𝑥
;0 ≤ 𝑥 < 2
5
1
;2 ≤ 𝑥 < 3
𝑓(𝑥) = 5
𝑥
(1 − 5) ; 3 ≤ 𝑥 < 5
{ 0; 𝑒𝑙𝑠𝑒𝑤ℎ𝑒𝑟𝑒
and the service time (Y) is uniformly distributed over [1,5].
(a) What is the scheme to generate inter-arrival time?
(b) What is the scheme to generate service time?
(c) Using above schemes and the three digits random numbers 440, 900, 196, 144,
532, 676, 804, 324, 100, 025 for simulating inter arrival times and 100, 225, 715,
322, 432, 213, 132, 098, 106, 130 for simulating the service in the order they
are given (you may not need all the random numbers), simulate the system for
8 units of time (assume initially there is one customer in the system). Prepare
the table with the following headings (with usual notations) T, CE, CNA, CND,
NS, NQ, CWTS, CWTQ, STS, CIDT, UA, IAT, NAT, US, ST, NDT, NET, NE
(in the order they are given). Hence, estimate 𝐿, 𝑊, 𝑊𝑞 and the fraction of time the
server is busy. [11M]

5. In a department office a group of clerks are working. They have common terminals
for typing their works and these terminals are reserved for these clerks. Assume that
typing times follow exponential distribution. Clerks are going to the terminal room in
a Poisson process. If in the office there is only one clerk and one terminal then it is
1
given that the probability that the terminal is idle is 2. If there are four clerks in the
groups and two terminals are working in parallel (with same service rate) then find the
following (with the same arrival and service rates and distributions as in the case of
single clerk)):
a) the probability that both the terminals are idle
b) the probability that only one terminal is idle
c) the expected number of clerks waiting to use one of the terminals
d) the constant 𝛼 for which 𝜆̅ = 𝛼𝜆 [7 M]

You might also like