DISTANCE EDUCATION
M.B.A DEGREE EXAMINATION, MAY 2017.
Second Semester
QUANTITATIVE METHODS
(Upto 2012-13 Academic year and 2013 Calendar year)
Time Three hours Maximum 100 marks
SECTION A — × 8 40 marks)
Answer any FIVE questions.
1. Write notes on the following terms:
Constants
Variables.
2. What is linear programming? What are its major
assumptions and limitations?
3. Write a note on the concept of probability.
4. Explain briefly Vogel's Approximation.
5. Define simulation. Why the simulation is used?
6. What is Decision Tree Approach?
7. Explain the terminologies of queuing theory.
8. Discuss the role of pay off tables in decision making.
Sub. Code
21
DE-840
2
Ws3
SECTION B — × 15 60 marks)
Answer any FOUR questions.
9. Solve the following linear programming using
Simplex methods
Maximize z 3x1 2x2 5x3
Subject to x1 2x2 x3 430
4 420
3 2 460
1 3
1 2


x x
x x
and x1 x2 x3 0
10. Solve the transportation problem
Definition
A B C D Supply
1 11 20 7 8 50
Source 2 21 16 20 12 40
3 8 12 18 9 70
Demand 30 25 35 40
11. A bag contains ten balls two of which are red, three blue
and five black. Three balls are drawn at random from the
bag, that is every ball has an equal chance of living
included in three. What is the probability that
Three balls are of different colours.
Two balls of same colour and
The balls are all of the same colour.
12. Explain briefly M M 1 queuing theory and its uses.
DE-840
3
Ws3
13. Given the following pay off function for each Act A and B.
Q x
Q x
B
A
80 29
25 40


Find the breakeven value of x .
If x 5 which is the better act?
If x 5 what is the regret of the poor strategy?
14. Explain the decision making frame work.
15. Solve using mini-max regret criteria.
States of nature
Alternatives High Moderate Low Nil
Expand 50,000 25,000 -25,000 -45,000
Construct 70,000 30,000 -40,000 -80,000
Sub construct 30,000 15,000 -1,000 -10,000