Reg. No.

:
Name :

TERM END EXAMINATIONS (TEE) – December - January 2021

Programme : B.Tech. Semester : Fall 2021-22
Course Name : Operation Research Course Code : MAT2004
Faculty Name : Dr. Sayed Mohammed Zeeshan Slot / Class No : B11+B12 / 0245
Time : 1½ hours Max. Marks : 50

Answer ALL the Questions

Q. No. Question Description Marks

PART - A ( 30 Marks)
1 (a) Obtain the dual of the following LPP: 10
Minimize: Z= 3x1 -2x2 + 4x3
Subject to the constraints:
3x1+5x2+4x3≥7
6x1+x2+3x3 ≥4
7x1 -2x2 –x3 ≤10
x1-2x2+5x3 ≥3
4x1 +7x2-2x3 ≥2
x1,x2,x3 ≥0

OR
(b) The given simplex table second iteration of an LPP. The table contains surplus variables and 10
artificial variables. Compute all the next iterations and obtain Zmax.

Iteration-2 Cj 2 3 0 -M
Cb xb x1 x2 S1 A1 Values
x2 0.5 1 0.5 0 2
A1 0.5 0 -0.5 1 1
Zj - Cj
2 (a) Task A, B, C, … H, I constitute a project. The notation X<Y means that the task X must be 10
finished before Y can begin. With this notation
A<D, A<E, B<F, D<F, C<G, C<H, F<I, G<I.
Draw the graph to represent the sequence of task and find the minimum time of completion of
the project, when the time (in days) of completion of each task is as follows:
Task: A B C D E F G H I
Time: 8 10 8 10 16 17 18 14 9
OR
(b) A single channel queuing system has Poison arrivals and exponential service times. The mean 10
arrival rate is 88 transactions per hour and the mean service rate is 23 per hour. Find (i) the
average time the costumer will wait in the system (ii) the average number of customers
waiting in the queue

Page 1 of 3
3 (a) From the given network diagram of the project: 10

Fill the following

Activity Immediate predecessors
A
B
C
D
E
F
G
H
I
J

OR
(b) For the following two-person zero sum game, find the optimal strategy for each player and the 10
value of the game:
𝑃𝑙𝑎𝑦𝑒𝑟 𝐴
𝐴1 𝐴2 𝐴3
𝐵1 −5 −3 1
𝑃𝑙𝑎𝑦𝑒𝑟 𝐵
𝐵2 [ 2 −1 2]
𝐵3 −2 3 4

PART - B (20 Marks)

4 From the given simplex table formulate the LP problem in two steps. First the LP problem 10
with necessary slack, surplus and artificial variables and then the original LP problem (with
inequality sign in constraints).
𝑪𝒋 4 6 3 1 0 0 0 Min
𝐶𝐵 𝐵 𝑏 𝑥1 𝑥2 𝑥3 𝑥4 𝑠1 𝑠2 𝑠3 Ratio

0 𝑠1 550 1.5 2 4 3 1 0 0
0 𝑠2 700 4 1 2 1 0 1 0
0 𝑠3 200 2 3 1 2 0 0 1

Page 2 of 3
 𝒁𝒋

𝒁𝒋 -𝑪𝒋

Solve the above simplex table to obtain optimum result.

5 XYZ charitable hospital provides free dental service to the patients on every morning. There are 10
three dentist on duty, who are equally qualified and experienced. It takes, on an average, 20
minutes for a patients to get treatment, and the actual time is known to vary approximately
exponentially around this average. The patients arrive according to the Poisson distribution with
an average of 6 per hour. The medical superintendent of the hospital wants to investigate the
following:
(i) The expected number of patients waiting in the queue.
(ii) The average time that a patients spends at the clinic.
(iii) The probability that a patients has to wait before he gets service.
(iv) The average percentage idle time for each of the dentists.


Page 3 of 3