OR Practice set

1. The security and traffic force, on the eve of Republic Day, must satisfy the staffing
requirements as shown in the table.

Time No. of officers

required
0.01-4.00 3
4.01-8.00 5
8.01-12.00 13
12.01-16.00 9
16.01-20.00 10
20.01-24.00 7

Officers work 8-hour shifts starting at each of the 4-hour interval as shown above.
Formulate this problem as an LP model so as to determine the minimum number of
officers required on duty at beginning of each time period.
2. A hospital has the following minimum requirement for nurses.

Period Clock time (24 Min. no. of nurses

hours day) required
1 6 A.M.-10 A.M. 60
2 10 A.M.-2 P.M. 70
3 2 P.M.-6 P.M. 60
4 6 P.M.-10 P.M. 50
5 10 P.M.-2 A.M. 20
6 2 A.M.-6 A.M 30
Nurses report to the hospital wards at the beginning of each period and work for eight
consecutive hours. The hospital wants to determine the minimum number of nurses so
that there may be sufficient number of nurses available for each period. Formulate this as
a L.P.P.
3. An electronic company is engaged in the production of two components C1 and C2 that
are used in radio sets. Each unit of C1 costs the company Rs 10 in wages and Rs 5 in
material, while each of C2 costs the company Rs 15 in wages and Rs 10 in material. The
company sells both products on one period credit terms, but the company’s labour and
material expenses must be paid in cash. The selling price of C1 units Rs 40 per unit and
of C2 is Rs 60 per unit. Because of the company’s strong monopoly in these components,
it is assumed that the company can sell, at the prevailing price, as many units as it
produces. The company’s production capacity is, however, limited by two
considerations. First, at the beginning of period 1, the company has an initial balance of
Rs 5,000 (cash plus bank credit plus collections from past credit sales). Second, the
company has, in each period, 3,000 hours of machines time and 1,600hours of assembly
time. The production of each C1 requires 3 hours of machines time and 2 hours of
assembly time, whereas the production of each C2 requires 2 hours of machine time and
 3 hours of assembly time. Formulate this problem as an LP model so as to maximize the
total profit to the company. Solve this by graphical method.
4. A farm is engaged in breeding pigs. The pigs are fed on various products grown on the
farm. In view of the need to ensure certain nutrient constituents 𝑁 , 𝑁 , 𝑁 , it is necessary
to buy two additional products 𝑃 and 𝑃 . One unit of 𝑃 contains 36 units of 𝑁 , 3 units
of 𝑁 and 20 units of 𝑁 . One unit of 𝑃 contains 6 units of 𝑁 , 12 units of 𝑁 and 10
units of 𝑁 . The minimum requirement of 𝑁 , 𝑁 , 𝑁 is 108 units, 36 units and 100 units
respectively. Product 𝑃 costs Rs. 20 per unit and 𝑃 costs Rs. 40 per unit. Formulate this
Diet Problem as an LP model and solve it graphically.
5. Use the graphical method to solve the following LP problem.

𝑀𝑎𝑥𝑧 = 2𝑥 + 𝑥
Subject to 𝑥 + 2𝑥 ≤ 10
𝑥 +𝑥 ≤6
𝑥 −𝑥 ≤2
𝑥 − 2𝑥 ≤ 1
𝑥 ,𝑥 ≥ 0
6. Use the graphical method to solve the following LP problem.

𝑀𝑖𝑛𝑧 = −𝑥 + 2𝑥
Subject to −𝑥 + 3𝑥 ≤ 10
𝑥 +𝑥 ≤6
𝑥 −𝑥 ≤2
𝑥 ,𝑥 ≥ 0
7. Comment on the solution of the following LP problem by graphical method.
𝑀𝑎𝑥𝑧 = 4𝑥 + 2𝑥
Subject to −𝑥 + 2𝑥 ≤ 6
−𝑥 + 𝑥 ≤ 2
𝑥 ,𝑥 ≥ 0
8. Comment on the solution of the following LP problem by graphical method.
𝑀𝑎𝑥𝑧 = 3𝑥 + 2𝑥
Subject to −2𝑥 + 3𝑥 ≤ 9
𝑥 − 5𝑥 ≥ −20
𝑥 ,𝑥 ≥ 0
9. Two linear simultaneous equations (linearly independent) with four unknowns
(variables) are given below.
4𝑥 + 2𝑥 + 3𝑥 − 8𝑥 = 6
3𝑥 + 5𝑥 + 4𝑥 − 6𝑥 = 8
(a) How many basic solutions are there:
(b) Find all of them.
(c) Discuss the nature of each and every basic solution.
10. Find the basic solution or solutions, if there be any, of the set of equations
2𝑥 + 4𝑥 − 2𝑥 = 10
 10𝑥 + 3𝑥 + 7𝑥 = 33
11. Check whether the set 𝑋 = 𝑥. 𝑦): 𝑥 + 4𝑦 ≤ 7} is a convex set or not.
{(
12. Check whether the set 𝑋 = {(𝑥. 𝑦): 𝑥 + 𝑦 ≤ 5} is a convex set or not.
13. Check whether the vectors (1,2,3),(2, 4,1),(3, 2, 9) are linearly independent. Justify your
answer.
14. Check whether the vectors (1, 3),(-1, 3),(2,-5),(2, 6) are linearly independent. Justify
your answer.
15. Prove that the vectors (1, 1, 0) and (3, 0, 1) are linearly independent and express (5, 2, 1)
as the linear combination of vectors (1, 1, 0) and (3, 0, 1).
16. Use (i) North-West Corner Method and (ii) Matrix Minima Method to find the initial
basic feasible solution to the following transportation problem where S1, S2, S3 are
sources and D1, D2, D3 are demands.
D1 D2 D3 D4 Supply
S1 17 20 40 20 7
S2 60 20 30 50 9
S3 30 8 60 10 18
Demand 5 8 7 14

17. A company has factories at F1, F2, F3 that supply products to warehouses at W1, W2, W3.
The unit shipping costs (in rupees) are given in the following table. Apply MODI
method to obtain minimum cost for the following unbalanced transportation problem
(using VAM):
W1 W2 W3 Supply
F1 15 21 13 200
F2 13 9 16 160
F3 22 25 18 90
Demand 180 120 150 450
18. Find the I.B.F.S. to the following transportation problem using North-West corner
method and prove that the optimal solution is nondegenerate though the initial solution is
degenerate.
D1 D2 D3 D4 Supply
S1 9 8 5 7 12
S2 4 6 8 7 14
S3 5 8 8 5 16
Demand 8 18 13 3

19. Find the optimal solution of the following Transportation problem by UV method
𝑊 𝑊 𝑊 𝑊 Availability
𝐹 21 16 25 13 11
𝐹 17 18 14 23 13
𝐹 32 27 18 41 19
Requirement 6 10 12 15
20. Solve the following unbalanced transportation problem (IBFS should be obtained by
using VAM). Find the amount which is not supplied and find the destination to which
the fake amount has been supplied.

𝐷 𝐷 𝐷 𝐷 Availability
𝑂 14 19 11 20 10
𝑂 19 12 14 17 15
𝑂 14 16 11 18 12
Requirement 8 12 16 14
21. Find the optimal assignments to find the minimum cost for the assignment problem with
the following cost matrix.

1 2 3 4
A 8 26 17 11
B 13 28 4 26
C 38 19 18 15
D 19 26 24 10
22. Solve the following unbalanced assignment problem for the assignment with the
following cost matrix.

1 2 3 4
A 10 12 8 6
B 6 9 12 14
C 3 8 7 12
23. The owner of a small machine shop has four machinists available to assign to jobs for
day. Five jobs are offered with expected profit for each machinist on each job as given in
the following table. Find the assignment of machinists to jobs that will result in a
maximum profit.
A B C D E
1 62 78 50 101 82
2 71 84 61 73 59
3 87 92 111 71 81
4 48 64 87 77 80
24. Find the optimal assignments for the assignment problem with the following PROFIT
matrix.
I II III IV
A 1 8 4 1
B 5 7 6 5
C 3 5 3 2
D 3 1 6 3
25. Solve the following travelling salesman problem

A B C D E
A ∞ 5 8 4 5
B 5 ∞ 7 4 5
C 8 7 ∞ 8 6
D 4 4 8 ∞ 8
E 5 5 6 8 ∞
26. A travelling salesman has to visit five cities. He wishes to start from a particular city,
visit each city once and then return to his starting pointy. The travelling cost of each city
from a particular city is given below:

A B C D E
A ∞ 14 10 24 41
B 6 ∞ 10 12 10
C 7 13 ∞ 8 15
D 11 14 30 ∞ 17
E 6 8 12 16 ∞

What should be the sequence of visit of salesman so that the cost is minimum and what is the
corresponding cost?
27. A travelling salesman has to visit five cities. He wishes to start from a particular city,
visit each city once and then return to his starting point. The travelling cost (in Rs ‘000)
of each city from a particular city is given below:

A B C D E
A ∞ 2 4 7 1
B 5 ∞ 2 8 2
C 7 6 ∞ 4 6
D 10 3 5 ∞ 4
E 1 2 2 8 ∞
What should be the sequence of visit of salesman so that the cost is minimum and what is the
corresponding cost?
28. Solve the game by method of dominance whose pay-off matrix is given below:

Player B
B1 B2 B3 B4
A1 2 -2 4 1
Player A A2 6 1 12 3
A3 -3 2 0 6
A4 2 -3 7 1

29. Use graphical method for solving game and find the value of the game.
 Player B
B1 B2
A1 1 -3
A2 3 5
Player A3 -1 6
A A4 4 1
A5 2 2
A6 -5 0

30. Use graphical method for solving game and find the value of the game.

Player B
Player B1 B2 B3 B4
A A1 2 2 3 -2
A2 43 2 6

31. Solve the following game:

Player B
𝐵 𝐵
Player

𝐴 1 7
A

𝐴 6 2

32. Consider the game of Odd-or-Even with the sole change that the loser pays the winner
the product, rather than sum, of the numbers chosen (who wins still depends on the sum).
Find the table for the pay-off function A, and analyze the game to find the value and
optimal strategies of the players. Is the game fair?
33. Player I holds a black Ace and a red 8. Player II holds a red 2 and a black 7. The players
simultaneously choose a card to play. If the chosen cards are of the same color, Player I
wins. Player II wins if the cards are of different color. The amount won is a number of
dollars equal to the number on the winner’s card (Ace counts as 1). Set up the payoff
function, find the value of the game and the optimal mixed strategies of the players.
34. Players I and II simultaneously call out one of the numbers one or two. Player I’s name
is Odd; he wins if the sum of the numbers is odd. Player II’s name is Even; she wins if
the sum of numbers is even. The amount paid to the winner by the loser is always the
sum of numbers in dollars. Construct the payoff matrix and hence solve it.
35. Find the saddle point (if any) for the following game whose pay-off matrix is given by

I II III IV
I -5 3 1 20
II 5 5 4 6
III -4 -2 0 -5
36. Find the critical activities for the following network
 Activity A B C D E F G H I J
Immediate _ A A A B C, D D B E, F, G
predecessors G
Duration 2 3 4 5 6 3 4 7 2 3

37. Find the critical activities for the following network

Activity A B C D E F G H
Immediate _ _ _ A B C D, E F, G
predecessors
Duration 2 4 3 1 6 5 7 2

38. Draw the network and find the critical activities, critical path, and completion time
Activity 1-2 1-3 2-3 2-5 3-4 3-6 4-5 4-6 5-6 6-7
Duration 15 15 3 5 8 12 1 14 3 14

39. Tasks A, B, C, D, E, F, G, H, I constitute a project. The precedence relationships are: A

< D, A < E, B < F, C < G, C < H, F < I, G < I. Draw a network. Identify the critical path.
The time, in days, 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
40. A project schedule has the following characteristics.
Activity 1-2 1-3 2-4 3-4 3-5 4-9 5-6 5-7 6-8 7-8 8- 9-
10 10
Time 4 1 1 1 6 5 4 8 1 2 5 7
(i) Construct a network diagram; (ii) Indicate critical activities; (iii) Find the critical path
and duration of the project.
41. At a work station, 5 jobs arrive every minute. The mean time spent on each job in the
work station is 1/8 minute. What is the average number of jobs in the system in the
steady state?
42. Arrivals to single bank counter are Poisson distributed with a rate of 20 per hour. The
average time for a customer to get service is 2 minutes and this time is exponentially
distributed. What is the average number of customers in the system? What is the average
number of customers in the queue? What will be the average waiting time in the system? What
will be the average waiting time in the queue? The probability that there would be other
customers in the queue.
43. An overhead crane of ABC Ltd. moves jobs from one machine to another and must be
used every time a machine requires loading or unloading. The demand for service is
random. Data taken by recording the elapsed time between service calls followed an
exponential distribution having a mean of a call every 24 minutes. In a similar manner,
the actual service time of loading or unloading took an average of 8 minutes. What is the
average number of units in the system? What is the average number of units in the queue? What
 will be the average waiting time in the system? What will be the average waiting time in the
queue?
44. The arrival rate for a certain waiting-line system obeys a Poisson distribution with the
average value of ½ units per period. The probability of one or more units in the system
does not exceed 0.25. What is the minimum service rate that must be provided if the
service duration follows an exponential distribution?
45. The arrival patterns of a waiting line system follows a Poisson distribution and the
service completion follow an exponential distribution with service rate 1 unit per period.
If the average length of the waiting line be 0.5 units, find arrival rate per period.
46. Solve the LPP by Simplex method
𝑀𝑎𝑥 𝑧 = 4𝑥 + 3𝑥
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 3𝑥 + 𝑥 ≤ 15; 3𝑥 + 4𝑥 ≤ 24; 𝑥 , 𝑥 ≥ 0
47. Solve the LPP by Simplex method
𝑀𝑎𝑥 𝑧 = 4𝑥 + 7𝑥
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 2𝑥 + 𝑥 ≤ 1000; 𝑥 + 𝑥 ≤ 600; −𝑥 − 2𝑥 ≥ −1000; 𝑥 , 𝑥 ≥ 0
48. Solve the LPP by Simplex method
𝑀𝑎𝑥 𝑧 = 5𝑥 + 2𝑥 + 2𝑥
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 𝑥 + 2𝑥 − 2𝑥 ≤ 30; 𝑥 + 3𝑥 + 𝑥 ≤ 36; 𝑥 , 𝑥 ≥ 0
49. Solve the LPP by Simplex method
𝑀𝑎𝑥 𝑧 = 𝑥 + 2𝑥
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 2𝑥 + 4𝑥 ≤ 20; 𝑥 + 𝑥 ≤ 8; 𝑥 , 𝑥 ≥ 0
50. Solve the LPP by Simplex method
𝑀𝑎𝑥 𝑧 = 𝑥 + 𝑥
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 𝑥 ≤ 10; 𝑥 − 3𝑥 ≤ 15; 𝑥 − 𝑥 ≤ 20; 𝑥 , 𝑥 ≥ 0