Operations Research

Assignment

Index

0 Operations Research (short Question Answers)

1 Linear Programing Problem (LPP)
2 Transportation Model
3 Assignment Techniques
4 Queuing Problems
5 Replacement Problems
6 Game Theory
7 Project Management
8 Inventory Control
 2 Transportation Model

1. Explain the transportation model with suitable example

2. What do you understand by unbalanced transportation problem? How to tackle it?
3. What do you mean by Rim condition? How will you allocate the units when ties occurs in
various condition?
4. When Dummy is required?
Solve the following problem with N-W corner, Raw Minima Method & List Cost Method
and find out best method out of this.

Warehouses
Supply
A B C D
X 2 3 11 7 6
Factories Y 1 0 6 1 1
Z 5 8 15 9 10
Demand 7 5 3 2

5. What do you mean by penalty? Why 0 penalty is more suitable condition for managers?
6. Explain Vogel’s Approximation method (VAM) and Find the Initial feasible solution VAM

Warehouses
Supply
A B C D E
P 20 4 32 28 20 3000
Plants Q 12 36 24 26 32 5000
R 16 8 28 24 20 8250
S 28 44 40 16 36 3750
Demand 3500 4000 2500 1500 4000

7. Find the initial feasible solution by VAM and optimum solution by Stepping stone/MODI
method
Warehouses
Availability
W1 W2 W3
A 16 20 12 240
Factories B 14 8 18 200
C 26 24 16 130
Requirements 190 150 110

8. Distinguish between Transportation and Transhipment problem in details.

9. What is degeneracy and redundancy in transportation problem?

10. Sahjanand Sports wish to purchase following quantity of cricket bats.

Bats type A B C D
Quantity 150 100 75 250

Tenders submitted by three manufacturers as below

Manufacturers SG Spartan MRF
Quantity 350 250 150

The store estimate that profit per bat will vary with manufacture as shown in matrix
below. How should order be placed for maximum profit?

A B C D
SG 2.75 3.5 4.25 2.25
Spartan 3.0 3.25 4.5 1.75
MRF 2.5 3.5 4.75 2.0

11. A manufacturer wants to ship 8 loads of his product as shown in the matrix. The matrix
gives mileage from origin O to destinations D. the shipping cost is ₹ 10 per load per mile.
What will be the optimum schedule and optimum cost? Use VAM for initial feasible
solution and MODI method for optimum solution.

G’Dham Morbi Baroda Supply

Bhuj 30 50 220 10
Rajkot 90 45 170 30
A’bad 250 200 50 40
Demand 35 35 20
Keep in mind that due to flooding Ahmedabad Morbi route is closed

12. Find the optimal solution using MODI method.

M1 M2 M3 M4 Supply
F1 3 2 4 1 20
F2 2 4 5 3 15
F3 3 5 2 6 25
F4 4 3 1 4 40
Demand 30 20 25 25

13. A transportation company has 5, 10, 7 & 3 trucks available at different sites A, B, C & D. its
customers have requirement of 5, 8 and 10 trucks at three destinations X, Y & Z
respectively. The distance in km from origin to destination is tabulated in matrix. Formulate
the problem and find optimum strategy for the transport company.

Customers
X Y Z
A 70 30 60
B 40 60 80
Sites
C 50 80 40
D 80 40 30
 3 Assignment Technique
1. Write the canonical form of assignment model and compare with the transportation
model

2. The following is the cost matrix of assigning the 4 operators to 4 jobs. Each operator
is assigned only one job so as to minimize the total cost of jobs. What will be the total
minimum job cost?

Job→
J1 J2 J3 J4
Operator↓
O1 2 10 9 7
O2 15 4 14 8
O3 13 14 16 11
O4 4 15 13 9

3. Discuss Travelling Salesman problem in brief.

The matrix below shows the cost in rupees of processing 3 jobs X, Y and Z on
machines A, B and C.
Machine→
A B C
Job↓
X 2 10 9
Y 15 4 14
Z 13 14 16

If all jobs can be processed on all machines, assign the jobs to the machines and
find the minimum total cost of processing.

4. A Bhuj Municipal Corporation has decided to carry out road repairs at main four entry in
the city. Government granted ₹ 50 Lakhs with condition that repair must be quick and
lowest in cost. Corporation received following bid from contractors. In order to make it
quick it is decided to give one road to one contractor only.

Roads → Mundra Mandvi G’Dham Wh Desert

Contractor↓ Road Road Road Road
A 9 14 19 25
B 7 17 20 19
C 9 18 21 18
D 10 12 18 19
E 10 15 21 16
 Assign each road to contractor to minimise cost.
 Whether it is completed in Allotted Grant
 Which contractor unable to receive contract?
5. The owner of a small machine shop has four machinists available. To assign jobs for the
days. Five jobs are offered with the expected profit in rupees for each machinist on each
job has been shown in matrix below. Find the assignment of machinists to jobs that will
result in a maximum profit. Which job should be declined?
JOB
A B C D E
1 6.20 7.80 5.00 10.10 8.20
Machinist
2 7.10 8.40 6.10 7.30 5.90
3 8.70 9.20 11.10 7.10 8.10
4 4.80 6.40 8.70 7.70 8.00

6. A school wants to pick up students from five different areas. Cost in rupees of going from
one area to another is shown in table. Find the optimal route to the bus drive such that
no repetition of the area comes before picking up students from all areas.
A B C D E
A 0 30 60 80 20
B 70 0 40 90 30
C 90 80 0 50 80
D 130 50 70 0 60
E 20 40 30 90 0

7. After dramatic defeat in world cup semi-final followed by criticism of batting order of
middle order batsman, Skiper Kohli and coach Shastri want to assign position based on the
average value scored by the batsman at respective order

III IV V VI
KOHLI 59 55 35 50
JADEJA 32 48 50 55
PANDYA 30 48 40 38
DHONI 23 50 52 55
V SHANKAR 45 41 38 40
R PANT 45 41 38 41

Assign each batsman to one position which would give the maximum number of runs
keeping in mind that skipper KOHLI wants JADEJA at number V irrespective of run scored
by him at other position.

8. Indian Airline operates 7 days a week has a following timetable for flight between Mumbai
to Bhuj. Crew must have a minimum layover of 1hrs between flights. Obtain the planning
for flights that minimise layover time away from home assuming that the crew can be
based at either of the two cities.

Mumbai to Bhuj Bhuj to Mumbai

Flight No. Departure Arrival Flight No Departure Arrival
1 7:00 8:00 101 8:00 9:15
2 8:00 9:00 102 8:30 9:45
3 13:30 14:30 103 12:00 13:15
4 18:30 19:30 104 17:30 18:45
 4 Queuing Problems
1 Cars arrive at service station every 15 minutes and the service time is 33 minutes. If
the line capacity of service station is limited to 5 cars then find the probability that the
service station is empty and the average number of cars in the system.

2 Explain the terms w.r.t. queuing theory

i) Balking
ii) Reneging
iii) Jockeying

3 At a reservation counter, 20 customers arrive on average every 10 minutes. The clerk

can serve 22 customers in 10 minutes. Find (i) average number of customers in the
system (ii) average queue length and (iii) average time a customer waits before being
served. State assumption made for the probability distribution

4 On an average 95 patients per 24 hrs day require the service of an emergency clinic.
Also on the average, a patient requires 12 minutes of an active attention. Assume that
the facility can handle only one emergency at a time. Suppose that it cost the clinic
Rs.100 per patient treated to obtain an average servicing of 10 minutes & that minute
of decreasing in this average time would cost Rs. 10 per patient treated. How much
would have to be budgeted by the clinic to decrease the average size of the queue
from one to one third patients to half a patient.

5 A copy maker has one copy making machine and he operates as the order comes. The
order arrival is poison distribution having interval time of 0.5 min. The average time to
serve a copy is distributed with mean of 0.3 min. Determine the following:
(1) Utilization factor of the machine
(2) Idle time for machine in a day having working hours of 10 hours
(3) No of persons waiting in the system
(4) No of persons waiting in the queue
(5) Average waiting time in the queue
 5 Replacement Problems
1. Following failure rates have been observed for certain type of light bulbs;

Month 1 2 3 4 5
Percentage of items failing by end of month 10 25 50 80 100

There are total 1000 bulbs in use and it costs Rs. 10 to replace an individual bulb which
has fused out. If all bulbs are replaced simultaneously, it would cost Rs. 4 per bulb. Two
policies are being considered for replacement of bulbs; First, replace all bulbs
simultaneously at fixed interval whether failed or not and do individual replacement in
intermediate periods. Secondly, individual replacement of bulbs as and when it fails.
Determine the optimum policy for replacement of bulbs based on above failure data and
costs.

2. The initial cost of a machine is Rs 71000 and scrape value is Rs 1000. The maintenance
costs found from experience are as below. Find when should the machine be replaced?

Year 1 2 3 4 5 6 7 8
Maintenance 2000 3500 5000 7000 10000 13000 17000 21000

3. A person is planning to purchase a car. A new car is costing rupees 3 lacs. The resale value
of the car at the end of the year is 85 % of the previous year. Maintenance and repair cost
during the first year are rupees 10000 and they increase by 15 % every year. The minimum
resale value of the car can be rupees 75000. (a) When should the car be replaced to
minimize average annual cost? (b) If interest rate of 12 % is assumed, calculate the average
cost at the end of 10 years.

4. What is the need for Replacement of any machine?

A machine was purchased with initial investment of Rs 40000. The following data is
available

Year 1 2 3 4 5 6
Operating & Maintenance
1400 1450 1510 1600 1720 1900
Cost /Year (Rs.)
Salvage Value (Rs.) 35000 34000 32500 30500 28000 25000

What will be the expected life as per optimum replacement policy and the average
annual cost during this period?
 6 Game Theory
1 Explain steps in Monte Carlo simulation process.

2 The following is the payoff matrix between player X and player Y. Find the optimal
strategies, their frequencies and the value of the game. Use rule of dominance and
oddment in calculations
Player Y
A B C D
I 0.25 0.20 0.14 0.30
II 0.27 0.16 0.12 0.14
Player X
III 0.35 0.08 0.115 0.19
IV -0.02 0.08 0.13 0.00

The following is the payoff matrix between player X and player Y. Find the optimal
strategies, their frequencies and the value of the game. Use rule of dominance and
oddment in calculations

3 For a game shown below, if X1 : X2 = (1/2) : (2/3) and Y1 : Y2 = (3/4) : (1/4)

Find expected pay off. Are these strategies optimal for player I and II? Why?
II
1 4
I
3 2

4 Define: Pay off, Value of game, Saddle point

5 Solve the cargo loading problem using following data. Maximum weight capacity is 5.

Weight Return
Item
Wn Rn
1 1 3
2 2 7
3 3 10