Chemical Engineering
Chemical Engineering
MODEL PAPER
B.Tech. DEGREE EXAMINATION.
Fourth Semester
Chemical Engineering
MA 036 — STATISTICS AND LINEAR PROGRAMMING
(Common to Textile Technology, Leather Technology and Textile Chemistry)
Time : Three hours Maximum : 100 marks
Answer ALL questions.
PART A — (10 2 = 20 marks)
1. The random variable X is exponentially distributed with mean 100. Find the
probability that X 90.
2. The probability density function of X is given by
2 x , 0 x 1
f (x )
0, elsewhere
Find the p.d.f. of Y g ( X ) 3 X 1.
4. State Central limit theorem and explain its significance.
6. Explain what is meant by randomised block design.
7. Formulate the following problem as a linear programming problem.
8. How are the alternative optima and unbounded solutions indicated in the
simplex procedure for a LPP?
9. What are the necessary and sufficient conditions for the existence of a feasible
solution for a transportation problem? If it has no such solution, how will you
solve the problem?
10. Write down the dual of the following LPP :
Max z 5x1 6x 2
subject to x1 2x 2 5
x1 5x 2 3
x1 , x 2 0 .
PART B — (5 16 = 80 marks)
11. (i) The following is the data on the number of defective electronic
components in 20 samples each of size 50. Establish the control limits for
p–charts and find whether the process is under control.
Sample : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
Number of defective
components : 8 6 5 7 2 5 3 8 4 4 3 1 5 4 4 2 3 5 6 3
(ii) Carry out the analysis of the following Latin square design using 0.05 level of
significance for each test :
A B C D
48 38 42 53
B C D A
39 43 50 54
C D A B
42 50 47 44
D A B C
46 48 46 52
2 M 005
12. (a) (i) Obtain the moment generating function of X whose p.d.f. is given by
x, 0 x 1
f ( x ) 2 x , 1 x 2
0, elsewhere
(ii) Use Chebyshev inequality to show that, if X is the number scored in a
throw of a fair die, P X 3.5 2.5 0.47.
(iii) If X has geometric distribution, show that for any two positive integers s
and t P X s t |X s P ( X t ).
Or
(ii) The probability that an experiment will succeed is 0.8. If the experiment
is repeated until four successful outcomes have occured, what is the
expected number of repetitions required?
13. (a) (i) Let X and Y have joint density function f ( x , y ) 2, 0 x y 1 .
Check whether X and Y are independent.
(ii) The fraction X of male runners and the fraction Y of female runners who
complete marathon races can be described by the joint density
function :
8 x y, 0 x 1, 0 y x
f ( x , y)
0, otherwise
Find the covariance of X and Y.
Or
3 M 005
( x y )
e
, 0 x , 0 y
f ( x , y)
0, otherwise
X
Find the density function of the random variable Z .
Y
(ii) Let (X, Y) be two–dimensional random variable with joint pdf
2, 0 x y 1
f ( x , y)
0, elsewhere
Find the correlation coefficient between X and Y.
Minimise z 2x1 8x 2
subject to
5x1 10x 2 150
x1 20
x 2 14
x1 , x 2 0.
(ii) Using artificial variable technique, solve :
Minimise z 3x1 2x 2
subject to
x1 x 2 2
x1 3x 2 3
x1 x 2 1
x 1 , x 2 0.
Or
Maximise z x1 x 2
subject to
2 x1 x 2 1
x1 2
x1 x 2 3
x 1 , x 2 0.
(ii) Use Simplex method, to solve the following LPP :
4 M 005
Maximise z 2x1 3x 2
subject to
x1 2x 2 4
x1 x 2 6
x1 3x 2 9
x 1 , x 2 0.
15. (a) (i) A company is sending a certain commodity from its factories to
different warehouses. The details of the capacities, requirements
and unit shipping cost are given below. Solve the transportation
problem, starting with the solution obtained by Vogel's
approximation method. If an alternate optimal solution exists, find
it also.
Warehouses Capacities
12 5 23 9 2100
Factories 7 10 11 13 1750
8 12 4 14 1150
(ii) Solve the following assignment problem, to minimise the total time
needed for all the four jobs.
Job
J1 J2 J3 J4
Operator O1 12 10 10 8
O2 14 12 15 11
O3 6 10 16 4
O4 8 10 9 7
Or
5 M 005
(b) (i) State duality theorem of a LPP. What can you say about the optimal
solution of the dual problem of the primal problem does not have a
feasible solution?
(ii) Solve the following LPP, using duality theory :
subject to
2x 1 x 2 x 3 2
3x1 x 2 3x 3 2
x1 3x 2 x 3 4
x 1 , x 2 , x 3 0.
———————
6 M 005