15P1MBA05

(For the candidates admitted from 2015 2016 onwards)

M.B.A DEGREE EXAMINATION
November / December - 2015
Model Question Paper

Quantitative Techniques for Business Decisions

Time: 3 Hours

Maximum: 75 Marks

Section A (10 2 = 20 marks)

Answer all Questions

1. What is Statistics?
2. What is tabulation?
3. Define Operation Research?
4. What is mathematical model?
5. What is linear programming?
6. Define the term Optimum Solution
7. Write the definition of Transportation model
8. Write a note on stepping store method
9. What is network?
10. What is fee float?

Section B (4 10 = 40 Marks)
Answer any FOUR Questions
11. Explain various methods of data collection
12. Discuss the origin and development of OR. What are the limitations of OR?
13. Explain simplex method of solving linear programming problem
14. Ready Mix Produces interior and exterior paints from two raw materials M1 & M2. The
requirement of raw material for these paints as well as their availability along with the
profit per tons is being expressed in the following table:
Tons of Raw
Material / Tons of

Raw Material M1
Raw Material M2
Profit/Ton (000$)

Exterio
r Paint
6
1
5

Interior
Paint
4
2
4

Maximum
Availability /
day (tons)
24
6

Market survey indicates that the daily demand for Interior Paint cannot exceed that of
Exterior Paint by more than 1 ton. Also, maximum daily demand of interior paint is 2
tons. Determine the optimal product mix that maximizes total daily profit.

15P1MBA05
15. The Amulya milk company has three plants located throughout a state with production
capacity 50, 75, and 25 gallons. Each day the firm must furnish its four retail shop R1,
R2, R3, R4 and 60 gallons respectively. The transportation costs (in Rs.) are given.
Plant

R
1
3
2
3
20

Retail Shop
R2 R3 R4

Supply

P1
5
7
6
50
P2
5
8
2
75
P3
6
9
2
25
Deman
20
50 60
d
The economic problem is to distribute the available product to different retail shops in
such a way that the total transportation cost is minimum?
16. A department has five employees with five jobs to be performed. The time (in hours)
each men will take to perform each job is given in the effectiveness matrices
Employees
I
II III IV V
A 10 5 13 15 16
Job B
3
9 18 13 6
C 10 7
2
2
2
s
D 7 11 9
7 12
E
7
9 10 4 12
How should the jobs be allocated , one per employee, so as to minimize the total manhour?
17. An assemble is to be made from two parts X and Y. Both pars must be turned on a lath
and Y must be polished whereas X need not be polished. The sequence of activities
together with their predecessors is given below. Draw the network diagram.
Activit
y
A
B
C
D
E
F
G
H

Description
Open work order
Get material for X
Get material for Y
Turn X on Lath
Turn Y on Lath
Polish Y
Assemble X and Y
Pack

Predecessor
Activity
A
A
B
B, C
E
D, F
G

Section C (1 15 = 15 Marks)
Case Study Analysis (Compulsory)
18. Solve using the Simplex method the following problem:

15P1MBA05
Maximize
subject to:

Z = f(x,y) = 3x + 2y
2x + y 18
2x + 3y 42
3x + y 24
x0,y0