DEPARTMENT: MBA (General)

SEMESTER: II
TITLE OF THE PAPER: QUANTITATIVE TECHNIQUES
SUBJECT CODE: 21CMBA21

SECTION A – UNIT I

1. Define Operations research.

2. Brief the history of Operations research.
3. Organize and list few applications of Operations research.
4. List the characteristics of Operations Research.
5. Discuss the meaning of model & mention its types?
6. Explain Modelling.
7. What is iconic model? Write its advantages and disadvantages?
8. Define Analogue model & symbolic model?
9. List the characteristics of a model.
10. Write the advantages and disadvantages of a model.
11. What is called as linear programming?
12. Explain the phases or methodology of OR.
13. Brief the scope of operations research.
14. What are the different types of solving Linear Programming Problem (LPP)?
15. What are the limitations of Operations research?

SECTION A – UNIT II

16. Define Transportation problem

17. What is meant as optimal solution in transportation problem?
18. Asses the methods used in transportation problem to obtain the initial basic
feasible solution?
19. Summarize the basic steps involved in solving a transportation problem.
20. Explain the difference between transportation and assignment problems.
21. Give the areas of operations of assignment problems.
22. Demonstrate unbalanced TP? How to resolve it?
23. What is unbalanced AP? How to resolve it?
24. What is meant by travelling salesman problem?
25. Define sequencing problem.
26. List the principle assumptions in sequencing problem.
27. Explain the steps in NWCR method
28. Brief the procedure and steps in VAM method
29. What is Least cost method (LCM) and write its steps.
30. Brief the uses of Transportation problems

SECTION A – UNIT III

31. Define Network analysis.

 32. What is Critical Path Method (CPM)?
33. List the type of times used in CPM.
34. Define PERT.
35. What is called as Path of a Network?
36. Differentiate EST and EFT.
37. Differentiate LST and LFT.
38. What is called total float?
39. What are the three different time estimates in PERT?
40. Define Project. What are the phases in project?
41. Mention the rules of network construction.
42. Explain the errors when constructing the network diagram.
43. Write the Fulkerson’s rule for numbering the events.
44. Distinguish between PERT and CPM.
45. Define Controlling.

SECTION A – UNIT IV

46. What is replacement theory?

47. Differentiate individual replacement policy and group replacement policy.
48. What is Game theory?
49. Define a player, strategy, finite game and infinite game.
50. What is two person zero sum game?
51. Give a note on pure strategy.
52. What is saddle point?
53. What are the properties of a game?
54. Define payoff.
55. Mention the types of games in game theory.
56. What is Maximin – Minimax principle?
57. List out the methods for solving the game problem.
58. Explain about Mixed strategy.
59. Brief the types of strategies used in Game theory.
60. List and explain the steps in replacement problems.

SECTION A – UNIT V

61. What is simulation?

62. Mention the types of simulations with examples.
63. Define Monte – Carlo simulation.
64. List the steps in Monte – Carlo simulation.
65. What are the uses of simulation?
66. Brief the limitations of simulation.
67. What are the procedures in simulation?
68. When simulation is the appropriate tool?
69. List the applications of simulation.
70. Define random variable.
71. Write the characteristics of queuing theory.
72. Mention the three types of queue discipline of the customer.
73. What is a model? Explain the types and characteristics of model.
74. Describe the procedure of simulation.
75. Write in detail about Hungarian method of Assignment problem.

SECTION B – UNIT I

76. Solve the following LPP problem using graphical method

Maximise Z = 12X1 + 16X2

Subject to 10X1 + 20X2 ≤ 120

8X1 + 8X2 ≤ 80

X1, X2 ≥ 0

77. Use graphical method to solve the following LPP problem.

Minimise Z = 4X1 + 6X2

Subject to X1 + X2 ≥ 8

6X1 + X2 ≥ 12

X1, X2 ≥ 0

78. Assess and Solve the following LPP problem using graphical method

Maximise Z = 22X1 + 18X2

Subject to 360X1 + 240X2 ≤ 5760

X1 + X2 ≤ 20

X1, X2 ≥ 0

79. Maximize Z = 0.10X1 + 0.06X2

Subject to the constraints
 X1 + X2 ≤ 50
2X1 + X2 ≤ 54
X1, X2 ≥ 0
Use graphical method to solve LPP.

80. Consider the following LPP problem and solve graphically.

Minimize Z = 0.60X1 + 0.80X2
Subject to the constraints
20X1 + 30X2 ≥ 900
40X1 + 30X2 ≥ 1200
X1, X2 ≥ 0

81. Solve LPP by using graphical method

Maximise Z = 7X1 + 3X2
Subject to
2X1 + 6X2 ≤ 24
6X1 + 2X2 ≤ 24
X1, X2 ≥ 0

82. Solve the following LPP by graphical method

Minimize Z = 20X1 + 10X2
Subject to the constraints
X1 + 2X2 ≤ 40
3X1 + X2 ≥ 30
4X1 + 3X2 ≥ 60
X1, X2 ≥ 0

83. Solve the following LPP by graphical method

Maximize Z = 3X1 + 2X2

Subject to the constraints

3X1 + 2X2 ≤ 6

2X1 + 3X2 ≤ 6

X1, X2 ≥ 0

84. Solve the following LPP by graphical method

 Maximize Z = 8X1 + X2

Subject to the constraints

X1 + X2 ≤ 40

2X1 + X2 ≤ 60

X1, X2 ≥ 0

85. Solve the following LPP by graphical method

Maximize Z = 50X1 + 15X2

Subject to the constraints

5X1 + X2 ≤ 100

X1 + X2 ≤ 50

X1, X2 ≥ 0

SECTION B – UNIT II

86. Calculate basic feasible solution of a transportation problem using North West Corner
rule.

Destination
D1 D2 D3 Supply
Source
S1 2 7 4 5
S2 3 3 1 8
S3 5 4 7 7
S4 1 6 2 14
Demand 7 9 18 34

87. Find the initial basic feasible solution of a transportation problem using Least cost
method
 Destination
D1 D2 D3 D4 Supply
Source
S1 1 2 3 4 6
S2 4 3 2 0 8
S3 0 2 2 1 10
Demand 4 6 8 6 24

88. Solve the transportation problem by Least cost method

Destination
D1 D2 D3 Supply
Source
S1 8 7 3 60
S2 3 8 9 70
S3 11 3 5 80
Demand 50 80 80 210

89. By using VAM (Vogel’s Approximation Method), Estimate the initial basic feasible
solution.

Destination
D1 D2 D3 D4 Supply
Source
S1 11 13 17 14 250
S2 16 18 14 10 300
S3 21 24 13 10 400
Demand 200 225 275 250 950

90. Determine the initial basic feasible solution of a transportation problem using VAM

Destination
D1 D2 D3 D4 Supply
Source
S1 3 3 4 1 100
S2 4 2 4 2 125
S3 1 5 3 2 75
Demand 120 80 75 25 300
91. By using VAM (Vogel’s Approximation Method), Assess and calculate the initial basic
feasible solution.

Destination
D1 D2 D3 D4 Supply
Source
S1 15 1 42 33 23
S2 80 42 26 81 44
S3 90 40 66 60 33
Demand 23 31 16 30 100

92. Estimate the transportation problem initial basic solution by North West Corner Rule
method

Destination
D1 D2 D3 Supply
Source
S1 2 2 3 10
S2 4 1 2 15
S3 1 3 1 40
Demand 20 15 30 65

93. Calculate the transportation problem initial basic solution the following transportation
problem using NWCR method

Destination
D1 D2 D3 D4 Supply
Source
S1 1 5 3 3 34
S2 3 3 1 2 15
S3 0 2 2 3 12
S4 2 7 2 4 19
Demand 21 25 17 17 80

94. Obtain the initial basic feasible solution of a transportation problem using Vogel’s
Approximation method.

Destination
D1 D2 D3 Supply
Source
S1 10 9 8 8
S2 10 7 10 7
S3 11 9 7 9
 S4 12 14 10 4
Demand 10 10 8 28

95. Find the minimum cost solution for the following transportation problem using VAM.

Destination
D1 D2 D3 Supply
Source
S1 16 19 12 14
S2 22 13 19 16
S3 14 28 8 12
Demand 10 15 17 42

SECTION B – UNIT III

96. The following table gives the activities in a construction project and other relevant
information

Activity 1-2 1–3 2–3 2-4 3-4 4-5

Duration
20 25 10 12 6 10
(Days)

(a) Draw the network for the project using CPM.

(b) Find the critical path and the project duration.
(c) Find the total float for each activity.

97. A project has the following time schedule

Activity Time in months

1-2 2
1-3 2
1-4 1
2-5 4
3-6 8
3-7 5
4-6 3
5-8 1
6-9 5
7-8 4
8-9 3

(d) Draw the network for the project using CPM.

 (e) Find the critical path and the project duration.
(f) Find the total float for each activity.

98. The following table gives the activities of a project and their duration in days

Activity Time in months

1-2 7
1-6 6
2-3 14
2-4 5
3-5 11
4-5 7
6-7 11
5-8 4
7-8 18
(a) Draw the network diagram using CPM and calculate the critical path and
duration
(b) Find the total float

99. A project scheduling has the following characteristics

Activity Time in days

1-2 4
1-3 1
2-4 1
3-4 1
3-5 6
4-9 5
5-6 4
5-7 8
6-8 1
7-8 2
8 - 10 5
9 - 10 7
Prepare Network using CPM and determine critical path, duration and total float.

100. The utility data for a network is given below. Use CPM to draw network, critical path,
duration and float.

Activity Time in days

0-1 2
1-2 8
 1-3 10
2-4 6
2-5 3
3-4 3
3-6 7
4-7 5
5-7 2
6-7 8

101. The following table lists the activities of a maintenance project.

Activity Duration in months

1-2 2
1-3 2
1-4 1
2-5 4
3-6 5
3-7 8
4-7 3
5-8 1
6-8 4
7-9 5
8-9 3
Draw the project network to determine critical path, duration and total float using
CPM.

102. The activities of a project have the following PERT time estimates

Activity O M P
1-2 3 6 15
1-6 2 5 14
2-3 6 12 30
2-4 2 5 8
3-5 5 11 17
4-5 3 6 15
5-8 1 4 7
6-7 3 9 27
7-8 4 19 28
Draw the network diagram, estimate the critical path, project completion time ,
variance and standard deviation

103. The following table gives the activities of a small project. Draw a network using
PERT, calculate critical path, project completion time and variance & standard deviation.
 Activity O M P
1-2 1 4 7
1-3 5 10 17
2-4 3 3 3
2-6 1 4 7
3-4 8 15 26
3-5 2 4 8
4-5 5 5 5
5-6 2 5 8

104. The following table gives data on estimates optimistic, most likely and pessimistic
duration in weeks for a project using PERT.

Activity O M P
1-2 1 1 7
1-3 1 4 7
1-4 2 2 8
2-5 1 1 1
3-5 2 5 14
4-5 2 5 8
5-6 3 6 15
Draw the project network and find the critical path, expected project duration and
variance & standard deviation.

105. The following indicates the details of the activities of a project. The duration are in
days. (PERT)

Activity O M P
1-2 4 5 6
1-3 8 9 11
1-4 6 8 12
2-4 2 4 6
2-5 3 4 6
3-4 2 3 4
4-5 3 5 8
(a) Draw project network (b) Find critical path (c) Find project completion time and
variance & standard deviation.

SECTION B – UNIT IV

106. A machine costs Rs. 10,000. Its operating cost (Running cost) and resale values are
given below.

Year 1 2 3 4 5 6 7 8
 Operating 1000 1200 1400 1700 2000 2500 3000 3500
maintenance
cost

Resale 6000 4000 3200 2600 2500 2400 2000 1600

value

Determine at what time it could be replaced?

107. A machine owner finds from his past records that the costs per year of maintaining a
machine whose costs is Rs. 6000 are given below

Year 1 2 3 4 5 6 7 8
Operating 1000 1200 1400 1800 2300 2800 3400 4000
maintenance
cost
Resale 3000 1500 750 375 200 200 200 200
value
Determine at what are a replacement is due?

108. The following table gives the running costs per year and the resale price of a certain
equipment whose costs is Rs. 5000

`Year 1 2 3 4 5 6 7 8
Operating 1500 1600 1800 2100 2500 2900 3400 4400
maintenance
cost
Resale value 3500 2500 1700 1200 800 500 500 500

At what year is the replacement due?

109. The following table gives the running cost per year and resale price of certain
machine whose costs is Rs. 50000.

`Year 1 2 3 4 5 6 7 8
 Operating 15000 16000 18000 21000 25000 29000 43000 40000
maintenance
cost
Resale value 35000 25000 17000 12000 8000 5000 5000 5000

At what year is the replacement due?

110. Solve the following game

Player B
12 1 30 -10
20 3 10 5
Player A -5 -2 25 0
15 -4 10 6

111. Discuss the solution of the following game with the payoff.

Player B
10 4 11 7
8 7 9 20
Player A
9 5 -2 12

112. Solve the game with the following payoff

Player B
0.4 0.5 0.9 0.3
0.8 0.4 0.3 0.7
Player A 0.7 0.6 0.8 0.9
0.7 0.2 0.4 0.6

113. Explain the maximin principle for game with the following payoff

Player B
20 12 15
Player A 11 10 12
15 11 10
114. Discuss the solution of the following game

Player B

8 2 9 5

6 5 7 18
Player A
7 3 -4 10

115. Solve the following game

Player B
-2 0 0 5 3
3 2 1 2 2
Player A -4 -3 0 -2 6
5 3 -4 2 -6

SECTION B – UNIT V

116. The automobile company manufactures around 150 scooters. The daily production
varies from 146 to 154 depending upon the availability of raw materials and other
working conditions.

Production per day Probability

146 0.04
147 0.09
148 0.12
149 0.14
150 0.11
151 0.10
152 0.20
153 0.12
154 0.08

The finished scooters are transported in a specially arranged lorry accommodating

150 scooters. Using the following random numbers 80, 81, 76, 75, 64, 43, 18, 26, 10,
12, 65, 68, 69, 61, 57. Simulate the process to find out
(i) What will be the average number of scooters waiting in the factory?
(ii) What will be the average number of empty spaces in the lorry?
117. A company manufactures around 200 mopeds. Depending upon the availability of raw
materials and other conditions, the daily production has been varying from 196 mopeds to
204 mopeds whose probability distribution is given below.

Production per day Probability

196 0.05
197 0.09
198 0.12
199 0.14
200 0.20
201 0.15
202 0.11
203 0.08
204 0.06

The finished mopeds are transported in a specially arranged lorry accommodating 200
mopeds. Using the following 15 random numbers 82, 89, 78, 24, 53, 61, 18, 45, 04,
23, 50, 77, 27, 54, 10. Simulate the process to find out
a. What will be the average number of mopeds waiting in the factory?
b. What will be the average number of empty spaces in the lorry?

118. The automobile company manufactures around 100 cars. The production is more
accurately described by the probability distribution given below.

Production per day Probability

95 0.03
96 0.05
97 0.07
98 0.10
99 0.15
100 0.20
101 0.15
102 0.10
103 0.07
104 0.05
105 0.03

The finished cars are transported in a specially arranged lorry accommodating 101
cars. (a) What will be the average number of cars waiting in the factory?
(b) What will be the average number of empty spaces in the lorry?
Using the following random numbers 68, 75, 29, 94, 08, 74, 36, 47, 31, 78, 38,
59, 91, 06, 31. Simulate the process.
119. Find the optimal solution for the assignment problem using Hungarian method with
the following cost matrix

AREA
W X Y Z
A 11 17 8 16
B 9 7 12 6
SALESMAN
C 13 16 15 12
D 14 10 12 11

120. Solve the following assignment problem using Hungarian method. The matrix entries
represent the processing time in hours.

OPERATOR
A B C D
1 5 3 2 8
2 7 9 2 6
JOB
3 6 4 5 7
4 5 7 7 8

121. Use Hungarian method to solve the assignment problem of four salesmen A, B, C and
D available to handle four counters W, X, Y and Z. Each salesman can handle any
counter. The matrix times are the service time in hours. Find the minimum total service
time.

SALESMEN
A B C D
W 41 72 39 52
X 22 29 49 65
COUNTERS
Y 27 39 60 51
Z 45 50 48 52

122. Solve the following assignment problem using Hungarian method. The matrix entries
represent the processing times in hours.

OPERATOR
1 2 3 4 5
JOB 1 9 11 14 11 7
2 6 15 13 13 10
3 12 13 6 8 8
 4 11 9 10 12 9
5 7 12 14 10 14

123. Assign the four tasks to four operators. Solve the following assignment problem using
Hungarian method.

OPERATORS
1 2 3 4
A 20 28 19 13
B 15 30 31 28
TASKS
C 40 21 20 17
D 21 28 26 12

124. Solve the following assignment problem shown in Table using Hungarian method. The
matrix entries are processing time of each man in hours

MEN
1 2 3 4 5
1 20 15 18 20 25
2 18 20 12 14 15
JOB 3 21 23 25 27 25
4 17 18 21 23 20
5 18 18 16 19 20

125. Assign the four person to four jobs. Solve the following assignment problem using
Hungarian method.

JOB
1 2 3 4
A 20 25 22 28
B 15 18 23 17
PERSON
C 19 17 21 24
D 25 23 24 24
SECTION C

126. Find the initial basic feasible solution of a transportation problem using (a) North
West Corner Rule (b) Least Cost method (c) VAM

Destination
D1 D2 D3 D4 Supply
Source
S1 6 4 1 5 14
S2 8 9 2 7 16
S3 4 3 6 2 5
Demand 6 10 15 4 35
127. Determine the initial basic feasible solution of a transportation problem using (a)
North West Corner Rule (b) Least Cost method (c) VAM

Destination
D1 D2 D3 Supply
Source
S1 2 7 4 5
S2 3 3 1 8
S3 5 4 7 7
S4 1 6 2 14
Demand 7 9 18 34

128. Solve the following transportation problem using (a) North West Corner Rule (b)
Least Cost method (c) VAM

Destination
D1 D2 D3 D4 Supply
Source
S1 48 60 56 58 140
S2 45 55 53 60 260
S3 50 65 60 62 360
S4 52 64 55 61 220
Demand 200 320 250 210 980

129. Estimate initial basic solution by solving the following transportation problem using
(a) North West Corner Rule (b) Least Cost method (c) VAM

Destination
D1 D2 D3 D4 Supply
Source
S1 190 300 500 100 70
S2 700 300 400 600 90
S3 400 100 600 200 180
Demand 50 80 70 140 340
130. A project has the following characteristic and time estimate – Optimistic time (O),
Most likely time (M) and Pessimistic time (P). Construct a PERT network to find the
critical path, project completion time and the variance & standard deviation.

Activity O M P
1-2 1 5 1.5
2-3 1 3 2
2-4 1 5 3
3-5 3 5 4
4-5 2 4 3
4-6 3 7 5
5-7 4 6 5
6-7 6 8 7
7-8 2 6 4
7-9 4 8 6
8 – 10 1 3 2
9 - 10 3 7 5

131. Compute the project network, critical path and variance & standard deviation using
PERT

Activity Optimistic Most likely Pessimistic

1-2 3 5 7
1-3 1 2 3
2-5 6 8 12
3-4 8 12 17
4-5 0 0 0
4-6 6 9 12
4-7 3 6 8
5-8 5 7 9
6-9 1 2 3
7 - 10 8 15 20
8-9 3 6 8
9 - 10 2 4 6

132. The following indicates the details of a project and the duration are in days. (a) Draw
the project network (b) Find the critical path (c) Calculate project completion time and
variance & standard deviation using PERT

Activity 1-2 1-3 1-4 2-4 2-5 3-4 4-5

O 2 3 4 8 6 2 2
M 4 4 5 9 8 3 5
P 5 6 6 11 12 4 7
133. The activities of a project and their time estimates are given below.

Activity O M P
1-2 2 5 8
1–4 4 19 28
1-5 5 11 17
2-3 3 9 27
2-6 3 6 15
3-6 2 5 14
4-6 3 6 15
5-7 1 4 7
5-8 2 5 14
6-8 6 12 30
7-8 2 5 8
Use PERT to determine critical path, project completion time and variance & standard
deviation.

134. Consider the following project whose activities along with PERT time estimates, the
optimistic time (O), most likely time (M) and pessimistic time (P) are given as follows

Activity O (days) M (days) P (days)

1-2 12 14 21
1-3 7 10 16
3-5 4 6 10
3-4 36 40 60
4-6 12 15 24
5-6 6 8 12
6-7 9 12 18
6-8 6 10 15
7–8 4 5 7
8–9 8 10 14
Construct the network diagram and find the critical path. Determine the project
completion time and its variance & standard deviation.

135. A truck owner finds from his past records that the maintenance costs per year of a
truck whose purchase price is Rs. 8000 are as given below.

Year 1 2 3 4 5 6 7 8
Operating 1000 1300 1700 2200 2900 3800 4800 6000
maintenance
 cost
Resale 4000 2000 1200 600 500 400 400 400
value
Determine the time at which it is profitable to replace the truck.

136. A machine costs Rs. 6000. The running cost and the resale value (salvage value) at
the end of the year is given below.

Year 1 2 3 4 5 6 7
Operating 1200 1400 1600 1800 2000 2400 3000
maintenance
cost
Resale value 4000 2666 2000 1500 1000 600 600

Find when the machine is to be replaced?

137. For the following payoff, find the value of the game

Player B
3 -1 4 6 7
-1 8 2 4 12
Player A 16 8 6 14 12
1 11 -4 2 1

138. Using the minimax criterion find the optimal strategies for the players in the
following game.

Player B
8 10 13 16 9
7 12 6 15 10
Player A 9 18 9 13 25
4 9 8 20 6

139. ABC Co. Like to launch a project involving various activities as follows. Construct a
project network using PERT, critical path, project completion time and variance.

Activity O M P
1-2 1 8 10
1-3 18 20 22
1-4 26 33 40
2-5 16 18 20
2-6 15 20 25
3-6 6 9 12
4-7 7 10 12
5-7 7 8 9
6-7 3 4 5

-----------------------