Printed Page: 1 of 3
Subject Code: KMBN206
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
MBA
(SEM II) THEORY EXAMINATION 2023-24
QUANTITATIVE TECHNIQUES FOR MANAGERS
TIME: 3 HRS [Link]: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
1. Attempt all questions in brief. 2 x 10 = 20
Q no. Question Marks CO
a. Explain the importance of Quantitative techniques in decision making. 02 1
b. A decision-maker is faced with three investment options: Investment A, 02 1
Investment B, and Investment C. The payoffs for these investments under
different market conditions (Good, Fair, Poor) are given in the following
payoff matrix. Apply the Maximax criterion to determine which investment
the decision-maker should choose.
Good Market Fair Market Poor Market
Investment A 100 50 -20
Investment B 80 60 40
Investment C 120 20 -30
47
c. What is an unbalanced transportation problem. 11 02 2
.1
d. Write the dual of the given primal linear programming problem 02 2
_3
Maximize Z=3x1+5x2
25
STC
P2
9.
2x1+3x2 ≤ 8
.3
4E
4x1+x2 ≤ 7
57
&
P2
x1, x2 ≥ 0
e. |1
Write the formula for calculating value of the game in a mixed strategy game. 02 3
Q
AM
f. What is maximization case in Assignment model. 02 3
g. Students arrive at the head office of Universal Teacher Publications according 02 4
to a Poisson input process with a mean rate of 40 per hour. The time required
8
to serve a student has an exponential distribution with a meanof 50 per hour.
:4
Assume that the students are served by a single individual, find the average
01
waiting time of a student.
9:
h. Explain the Processing of n jobs through m machines. 02 4
i. Explain significance of replacement model. 02 5
24
j. Discuss the significance of merge and burst events. 02 5
20
SECTION B
-
ug
2. Attempt any three of the following: 3 x 10 = 30
A
a. What is decision theory. Outline various types of decision-making 10 1
7-
environment.
|2
b. Solve the following LPP by graphical method. 10 2
Minimize Z = 20x1+10x2
STC
x1+2x2 ≤ 40
3x1+x2 ≥ 30
4x1+3x2 ≥ 60
&
1|Page
QP24EP2_311 | 27-Aug-2024 [Link] AM | [Link]
Printed Page: 2 of 3
Subject Code: KMBN206
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
MBA
(SEM II) THEORY EXAMINATION 2023-24
QUANTITATIVE TECHNIQUES FOR MANAGERS
TIME: 3 HRS [Link]: 100
x1, x2 ≥ 0
c. There are five jobs to be assigned, one each to five machines and the 10 3
associated cost matrix is as follows. Solve this minimal assignment problem.
Job 1 2 3 4 5
A 11 17 8 16 20
B 9 7 12 6 15
C 13 16 15 12 16
D 21 24 17 28 26
E 14 10 12 11 15
d. Explain the concept of a queuing and discuss the key components. Also 10 4
provide examples of real-world applications where queuing theory is utilized
to optimize efficiency and customer satisfaction.
e. Draw the network and find the critical path and the critical time from the given 10 5
data
Jobs 1-2 1-3 2-4 3-4 3-5 4-5 4-6 5-6
47
Duration (in 6 5 10 3 114 6 2 9
.1
days)
_3
25
SECTION C
P2
3. Attempt any one part of the following: 1 x 10 = 10
9.
.3
4E
a. “Operation research can be considered a discipline, a profession, a collection 10 1
57
of techniques, or even a philosophy. “Discuss the statement by explaining
P2
techniques of OR.
b. A newspaper hawker must decide how many newspapers to purchase each 10 |1 1
Q
day. Each newspaper costs Rs.0.50/- and sells for Re 1.00/-. Unsold
AM
newspapers have no salvage value. The demand for newspapers varies daily
according to the following probability distribution. Determine the optimal
8
number of newspapers the hawker should purchase to maximize their expected
:4
profit.
01
Number of 10 20 30 40
Newspapers
9:
Probability 0.1 0.3 0.4 0.2
24
4. Attempt any one part of the following: 1 x 10 = 10
20
a. “Linear Programming has no real-life applications”. Do you agree with this 10 2
statement. If No Justify your answer.
-
ug
b. Determine the initial basic feasible solution of the given transportation 10 2
problem using Vogel’s approximation Method (VAM) and hence find the
A
optimal solution.
7-
|2
D1 D2 D3 D4 Supply
O1 6 4 1 5 14
O2 8 9 2 7 16
O3 4 3 6 2 5
Demand 6 10 15 4 35
5. Attempt any one part of the following: 1 x 10 = 10
2|Page
QP24EP2_311 | 27-Aug-2024 [Link] AM | [Link]
Printed Page: 3 of 3
Subject Code: KMBN206
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
MBA
(SEM II) THEORY EXAMINATION 2023-24
QUANTITATIVE TECHNIQUES FOR MANAGERS
TIME: 3 HRS [Link]: 100
a. Illustrate Hungarian Algorithm and write its application in decision making. 10 3
b. Solve the game by using the principle of dominance. 10 3
Player B
Player A 1 7 3 4
5 6 4 5
7 2 0 3
6. Attempt any one part of the following: 1 x 10 = 10
a. There are six jobs which must go through two machines A and B Processing 10 4
time in hours is given below:
JOB 1 2 3 4 5 6
A 8 19 11 12 16 20
B 7 5 2 14 3 9
Evaluate the total elapsed time and the idle time for both machines A & B
b. Assess the basic characteristics of a Queue System. Also discuss customer’s 10 4
behavior in a queue.
47
7. Attempt any one part of the following: 11 1 x 10 = 10
.1
_3
a. A machine costs Rs. 10,000/-. It’s operating and resale values are given below. 10 5
25
Determine at what time the machine should be replaced.
P2
9.
Year 1 2 3 4 5 6 7 8
.3
Operating 1000 1200 1400 1700 2000 2500 3000 3500
4E
Cost
57
Resale 6000 4000 3200 2600 2500 2400 2000 1600
P2
|1
Value
Q
b. Distinguish between CPM and PERT. Also explain how total float is 10 5
AM
calculated from the network diagram.
8
:4
01
9:
24
- 20
A ug
7-
|2
3|Page
QP24EP2_311 | 27-Aug-2024 [Link] AM | [Link]
