ASSIGNMENT

On
SUBJECT: OPERATIONS RESEARCH
(MMSC203)

Submitted By

Name of the Student: _________________________

Roll No.:____________

Date of Submission: _____________

Semester-II

Batch (2023-25)
 RAJEEV GANDHI COLLEGE OF MANAGEMENT STUDIES
GHANSOLI, NAVI MUMBAI – 400701
SEMESTER-II
Subject: OPERATIONS RESEARCH (MMSC203)
ASSIGNEMNT

Total Marks: 30
Instructions:
All Questions are compulsory
Figures to right indicate marks.

Q.1 Solve the following LPP by using Graphical Method. 5M

Maximize Z= 2X1 + X2,
Subject to X1 + 2X2 ≤ 10,
X1 + X2 ≤ 6,
X1 - X2 ≤ 2,
X1 - 2X2 ≤ 1,
X1, X2 ≥ 0.
OR
Solve the following LPP by using Simplex Method.
Minimize Z= 2Y1 + 3Y2,
Subject to Y1 + Y2 ≥ 5,
Y1 + 2Y2 ≥ 6,
Y1, Y2 ≥ 0.

Course Outcome: (CO1)

Q.2 Solve the transportation problem using VAM Method for which the cost, origin 5M
availabilities and destination requirements are given below.

Destination
Availability
D1 D2 D3 D4 D5 D6
O1 1 2 1 4 5 2 30
Origin O2 3 3 2 1 4 3 50
O3 4 2 5 9 6 2 75
O4 3 1 7 3 4 6 20
Requirement 20 40 30 10 50 25 175 (Total)

OR
Solve the following assignment problem:

I II III IV V
1 11 17 8 16 20
2 9 7 12 6 15
3 13 16 15 12 16
4 21 24 17 28 26
5 14 10 12 11 15

Course Outcome: (CO2)

Q.3 Solve the following game and find the game strategies and game value: 5M

Player B
1 2 3 4
1 20 50 25 17
Player A 2 55 54 81 84
3 45 44 80 73
OR

Solve the following game by dominance method:

Player B
I II III IV V VI
1 4 2 0 2 1 1
2 4 3 1 3 2 2
Player A 3 4 3 7 -5 1 2
4 4 3 4 -1 2 2
5 4 3 2 -2 2 2

Course Outcome: (CO3)

Q.4 The following matrix gives the payoff of different strategies S1, S2, S3 against 5M
different conditions N1, N2, N3 and N4.

N1 N2 N3 N4
S1 4000 -100 6000 18000
S2 20000 5000 400 0
S3 20000 15000 -2000 1000

Indicate the decision taken under the following approach:

i) Pessimistic ii) Optimistic iii) Regret and iv) Equal probability

OR
The daily demand for the breads in the city can assume on of the following values:
3400; 3600; 3700 or 3800 breads with the probabilities 0.18, 0.12, 0.20 and 0.50.
If the stockiest stocks more than the need, he can return them at a discount price of
Rs. 8 per bread. Assuming that he pays Rs. 8.50 per bread and sells it for Rs. 9.50
per bread, find the optimum stock level by using a decision tree representation.

Course Outcome: (CO4)

Q.5 Workers come to tool store room to receive special tools (required by them) for 5M
accomplishing a particular project assigned to them. The average time between
two arrivals is 60 seconds and the arrivals are assumed to be poison distribution.
The average service time (of the tool room attendant) is 40 seconds. Determine
a) Average queue length
b) Average length of non-empty queues
c) Average number of workers in system including the worker being attended
d) Mean waiting time of an arrival
 e) Average waiting time of an arrival (worker) who waits
OR
A repairman is to be hired to repair machines which breakdown at an average rate
of 3 per hour. The breakdowns follow Poisson distribution. Non-productive time
of machines is considered to cost Rs. 16 per hour. Two repairmen have been
interviewed: one is slow but cheap while the other is fast but expensive. The slow
repairman charges Rs. 8 per hour and he services broken down machines at the
rate of 4 per hour. The fast repairman demands Rs. 10 per hour and he services at
an average rate of 6 per hour. Which repairman should be hired? Assume an 8-jour
working day.

Course Outcome: (CO5)

Q.6 A dentist schedules all her patients for 30 minutes appointments. Some of the 5M
patients take more or less than 30 minutes depending on the type of dental work to
be done. The following summary shows the various categories of work, their
probabilities and the time needed to complete the work.

Category Time Required (minutes) Probability of category

Filling 45 0.40
Crown 60 0.15
Cleaning 15 0.15
Extraction 45 0.10
Checkup 15 0.20

Simulate the dentist’s clinic for four hours and determine the average waiting time
for the patients as well as the idleness of the doctor. Assume that all the patients
show up at the clinic at exactly their scheduled arrival times, starting at 8 A.M.
Use the following random numbers for handling the above problem: 40, 82, 11,
34, 25, 66, 17 and 79.

OR
A company trading in motor vehicle spares wishes to determine the level of stock
it should carry for the items in its range. Demand is not certain and there is a lead
time for stock replenishment. For one item X, the following information is
obtained:
Demand (units/day) 3 4 5 6 7
Probability 0.1 0.2 0.3 0.3 0.1

Carrying cost per unit per day = 20 paise,

Ordering cost per order = Rs. 5,
Lead time for replenishment = 3 days.

Stock in hand at the beginning of the simulation exercise was 20 units. You are
required to carry out a simulation run over a period of 10 days with the objective
of evaluation the following inventory rule:
Order 15 units when present inventory plus any outstanding order falls below 15
units.
The sequence of random numbers used is 0, 9, 1, 1, 5, 1, 8, 6, 3, 5, 7, 1, 2, 9 using
the first number for day one. Your calculation should include the total cost of
operating this inventory rule for 10 days.
 Course Outcome: (CO6)

ANSWERS:

Q.1
X1=4, X2=2 and Zmax=10
OR
Y1=4, Y2=1, Zmin=11

Q.2
X11=20, X13=10, X23=20, X24=10, X25=20, X32=40, X35=10, X36=25, X45=20
OR
1🡪I, 2🡪IV, 3🡪V, 4🡪III, 5🡪II, Zmin=60

Q.3
A2, B2; V=54
OR
A(0,6/7,1/7,0,0), B(0,0,4/7,3/7,0,0); 13/7

Q.4
i) S2, ii) S2 or S3, iii) S1, iv) S3
OR
EMV of node A= Rs. 3400; EMV of node B= Rs. 3546; EMV of node C=Rs. 3601; EMV of
node D= Rs. 3626; The optimum stock level is 3800 breads.

Q.5
a) 4/3 workers, b) 3 workers, c) 2 workers, d) 4/3 minutes, e) 2 minutes
OR
Total cost per day of slow repairman=Rs. 448; Total cost per day of fast repairman =Rs. 208.
Fast repairman should be hired.

Q.6
Average waiting time for the patients= 35.625 minutes; Average idleness of the dentist= Nil
OR
Total cost of operating inventory for 10 days = Rs. (19+15) = Rs. 34