(a) Suppose that a given individual in a population has a survival time which is exponential with a hazard rate θ. Each individual's hazard rate θ is potentially different and is sampled from a Weibull distribution with probability density function :
f(θ) = (α/λ) (θ/λ)^(α−1) exp(−(θ/λ)^α), 0 ≤ θ < ∞
Let X be the life length of a randomly chosen individual of this population.
(i) Find the survival function of X.
(ii) Find the hazard rate of X. What is the shape of the hazard rate ? (10 marks)
(b) Construct a single sampling plan for attributes, given the following data :
A.Q.L. = 0·05
Producer's risk = 0·05
Consumer's risk = 0·10
LTPD = 0·20 (10 marks)
(c) Describe the effect of sample size on X̄, R and s charts for the sample sizes n ≤ 5, 5 < n ≤ 10 and n > 10. (10 marks)
(d) Given a transition probability matrix with three states {1, 2, 3} as :
P = ( 0·6 0·3 0·1
0·2 0·6 0·2
0·4 0·4 0·2 )
Find the value of P(X5 = 2 | X3 = 3) and P(X3 = 1 | X0 = 3). (10 marks)
(e) What are the key features of SPSS software ? How does it compare to R software ? (10 marks)
हिंदी में पढ़ें
(a) मान लीजिए कि किसी जनसंख्या में किसी व्यक्ति का उत्तरजीविता काल एक संकटप्रस्त दर θ के साथ चरघातांकी है। प्रत्येक व्यक्ति की संकटप्रस्त दर θ संभावित रूप से भिन्न हो सकती है और इसको वेबुल बंटन से चयनित किया जाता है, जिसका प्रायिकता घनत्व फलन है :
f(θ) = (α/λ) (θ/λ)^(α−1) exp(−(θ/λ)^α), 0 ≤ θ < ∞
मान लीजिए कि इस जनसंख्या में से यादृच्छिक रूप से चुनी गई किसी व्यक्ति की जीवन अवधि X है।
(i) X का उत्तरजीविता फलन ज्ञात कीजिए।
(ii) X की संकटप्रस्त दर ज्ञात कीजिए। संकटप्रस्त दर का स्वरूप क्या है? (10 अंक)
(b) निम्नलिखित आँकड़ों से, गुणों के लिए एक एकल प्रतिचयन योजना बनाइए :
A.Q.L. = 0·05
उत्पादक का जोखिम = 0·05
उपभोक्ता का जोखिम = 0·10
LTPD = 0·20 (10 अंक)
(c) प्रतिदर्श आकार n ≤ 5, 5 < n ≤ 10 और n > 10 के लिए X̄, R और s चार्ट पर प्रतिदर्श आकार के प्रभाव का वर्णन कीजिए। (10 अंक)
(d) तीन अवस्थाओं {1, 2, 3} वाले दिए गए संक्रमण प्रायिकता आव्यूह :
P = ( 0·6 0·3 0·1
0·2 0·6 0·2
0·4 0·4 0·2 )
से P(X5 = 2 | X3 = 3) और P(X3 = 1 | X0 = 3) का मान ज्ञात कीजिए। (10 अंक)
(e) SPSS (एस पी एस एस) सॉफ्टवेयर की प्रमुख विशेषताएँ क्या हैं ? यह R सॉफ्टवेयर की तुलना में कैसा है ? (10 अंक)
Answer approach & key points
(a) A frailty/mixture problem: X | theta ~ Exponential(hazard theta) and theta ~ Weibull(shape alpha, scale lambda) with pdf f(theta) = (alpha/lambda)(theta/lambda)^(alpha-1) exp(-(theta/lambda)^alpha). Candidate must (i) derive the unconditional survival function S_X(x) by mixing (un-conditioning) over theta, and (ii) obtain the unconditional hazard rate h_X(x) and state its shape. Both sub-parts must be answered. (b) Design a single sampling plan by attributes, i.e. find the sample size n and acceptance number c, given AQL p1 = 0.05 with producer's risk alpha = 0.05 and LTPD p2 = 0.20 with consumer's risk beta = 0.10. The plan must be stated explicitly and its two risk conditions verified. (c) Describe how the choice of subgroup size n affects the X-bar, R and s control charts, treating the three stated ranges separately: n <= 5, 5 < n <= 10, and n > 10. The answer must cover both which dispersion chart is appropriate in each range and what happens to the limits and sensitivity of the X-bar chart. (d) For the given 3-state transition probability matrix P, use the Chapman-Kolmogorov equations (time-homogeneity) to evaluate the two-step probability P(X5 = 2 | X3 = 3) = p_32^(2) and the three-step probability P(X3 = 1 | X0 = 3) = p_31^(3). Both values must be computed. (e) Two parts: (i) list and explain the key features of IBM SPSS Statistics, and (ii) compare SPSS with R on the dimensions that matter to a statistician - cost/licensing, interface, extensibility, output, graphics, data handling and suitability for different tasks. Both parts must be answered.
- S(x | theta) = exp(-theta x)
- S_X(x) = E_theta[exp(-theta x)] (Laplace transform of the frailty distribution)
- h_X(x) = E[theta | X > x]
- h_X'(x) = -Var(theta | X > x) < 0
- Decreasing hazard rate (DFR) / decreasing failure rate
- h_X(0) = lambda*Gamma(1 + 1/alpha)
- alpha = 1 case: S_X(x) = 1/(1 + lambda x), Lomax/Pareto
- AQL p1 = 0.05, LTPD p2 = 0.20, alpha = 0.05, beta = 0.10
- Operating ratio R = p2/p1 = 4.0
- Cameron's table of Poisson unity values (np1 for P = 0.95, np2 for P = 0.10)
- c = 4
- n = 40
- Plan: sample 40, accept if defectives <= 4
- Verification alpha ~ 0.053, beta ~ 0.0996
- A2, A3, d2, c4, D3, D4, B3, B4 control-chart constants
- sigma-hat = R-bar/d2 and sigma-hat = s-bar/c4
- Relative efficiency of range versus standard deviation falls with n (about 0.955 at n = 5, 0.850 at n = 10)
- R chart for n <= 5, s chart for n > 10
- X-bar limit half-width = 3 sigma/sqrt(n)
- D3 = 0 for n <= 6, B3 = 0 for n <= 5
- Chapman-Kolmogorov equation p_ij^(m+n) = sum_k p_ik^(m) p_kj^(n)
- Time-homogeneous Markov chain
- Third row of P^2 = (0.40, 0.44, 0.16)
- P(X5 = 2 | X3 = 3) = 0.44
- P(X3 = 1 | X0 = 3) = 0.392
- IBM SPSS Statistics (Statistical Package for the Social Sciences)
- Data View / Variable View, variable and value labels, defined missing values
- SPSS Command Syntax and the Paste button; Output Viewer pivot tables
- Modules: Advanced Statistics, Custom Tables, Complex Samples, AMOS
- R is free open-source (GPL); CRAN; ggplot2; RStudio / R Markdown
- Proprietary licence versus open source; GUI versus script
(a) (i) Describe the construction of a CUSUM chart with Decision interval and Reference value. (10 marks)
(ii) One implementation of the CPU-cache-main memory subsystem of the PDP 11/70 consists of the following chip types :
Chip type | Number of chips, n_i | Failure rate per chip (number of failures/10^6 hours), λ_i
SSI | 1,202 | 0·1218
MSI | 668 | 0·242
ROM | 58 | 0·156
RAM | 414 | 0·691
MOS | 256 | 1·0602
BIP | 2,086 | 0·1588
It is assumed that the times to failure of all chip types are exponentially distributed with the failure rates (λ_i) shown above. All the chips must be fault-free in order for the system as a whole to be fault-free.
(I) Find the system time-to-failure.
(II) Find the mean lifetime of the system.
(III) What is the probability that the system will still function after 1,000 hours of use ? (10 marks)
(b) What is the minimax criterion with respect to a game ? Given below is the payoff matrix corresponding to a game :
| B_1 | B_2 | B_3 | B_4
A_1 | −2 | −1 | −2 | 8
A_2 | 1 | 0 | −1 | −1
A_3 | −3 | 1 | −3 | 1
Determine whether the game is stable or not. Also, obtain the optimal strategies and the value of the game. (15 marks)
(c) (i) The PQR retail company has the following data available for one of its items :
D = 10,000 units,
S = ₹ 20;
C = 25% of the acquisition cost of ₹ 25.
Find :
(I) the economic order quantity, and
(II) the total inventory cost. (5 marks)
(ii) A company has 4 workers and 4 jobs. Each worker can perform any job, but the cost (in ₹) of assigning a worker to a job varies, as shown in the table given below :
| Job / Worker | 1 | 2 | 3 | 4 |
| 1 | 9 | 2 | 7 | 8 |
| 2 | 6 | 4 | 3 | 7 |
| 3 | 5 | 8 | 1 | 8 |
| 4 | 7 | 6 | 9 | 4 |
Assign each worker to exactly one job such that the total cost of assignment is minimum. (10 marks)
हिंदी में पढ़ें
(a) (i) निर्णय अंतराल तथा संदर्भ मान के साथ एक CUSUM चार्ट की बनावट का वर्णन कीजिए। (10 अंक)
(ii) PDP 11/70 के CPU-कैश-मुख्य स्मृति उपतंत्र के एक कार्यान्वयन में निम्नलिखित चिप प्रकार सम्मिलित होते हैं :
चिप प्रकार | चिपों की संख्या, n_i | प्रति चिप विफलता दर (10^6 घंटों में विफलताओं की संख्या), λ_i
SSI | 1,202 | 0·1218
MSI | 668 | 0·242
ROM | 58 | 0·156
RAM | 414 | 0·691
MOS | 256 | 1·0602
BIP | 2,086 | 0·1588
यह मान लिया जाता है कि सभी चिप प्रकारों के विफल होने के समय घातांकीय रूप से बंटित हैं जिनकी विफलता दरें (λ_i) ऊपर दर्शाई गई हैं। समग्र तंत्र के दोष-मुक्त होने के लिए सभी चिपों का दोष-मुक्त होना आवश्यक है।
(I) तंत्र का विफलता-पर्यंत समय ज्ञात कीजिए।
(II) तंत्र का माध्य जीवनकाल ज्ञात कीजिए।
(III) 1,000 घंटे के उपयोग के पश्चात् तंत्र के अब भी कार्यरत रहने की प्रायिकता क्या है ? (10 अंक)
(b) खेल के संबंध में मिनिमैक्स (अल्पमहिष्ठ) (minimax) मानदंड क्या है ? नीचे एक खेल से संबंधित भुगतान आव्यूह दिया गया है :
| B_1 | B_2 | B_3 | B_4
A_1 | −2 | −1 | −2 | 8
A_2 | 1 | 0 | −1 | −1
A_3 | −3 | 1 | −3 | 1
ज्ञात कीजिए कि खेल स्थिर है या नहीं। खेल की सर्वोत्तम रणनीतियाँ तथा खेल का मान भी ज्ञात कीजिए। (15 अंक)
(c) (i) PQR रिटेल कंपनी के पास अपने एक उत्पाद के लिए निम्नलिखित आँकड़े उपलब्ध हैं :
D = 10,000 इकाइयाँ,
S = ₹ 20;
C = अधिग्रहण लागत ₹ 25 का 25%.
ज्ञात कीजिए :
(I) आर्थिक आदेश मात्रा, एवं
(II) कुल भंडार लागत। (5 अंक)
(ii) एक कंपनी में 4 कर्मचारी और 4 नौकरियाँ (कार्य) हैं । प्रत्येक कर्मचारी कोई भी कार्य कर सकता है, लेकिन किसी कर्मचारी को कार्य आबंटित करने की लागत (₹ में) अलग-अलग है । इसे नीचे दी गई सारणी में दर्शाया गया है :
| कार्य / कर्मचारी | 1 | 2 | 3 | 4 |
| 1 | 9 | 2 | 7 | 8 |
| 2 | 6 | 4 | 3 | 7 |
| 3 | 5 | 8 | 1 | 8 |
| 4 | 7 | 6 | 9 | 4 |
प्रत्येक कर्मचारी को ठीक एक ही कार्य इस प्रकार आबंटित कीजिए जिससे कि आबंटन की कुल लागत न्यूनतम हो। (10 अंक)
Answer approach & key points
(a(i)) Describe how a CUSUM control chart is constructed, specifically in its tabular (algorithmic) form, explaining and using the two design parameters named in the question: the reference value (allowance) K and the decision interval H. (a(ii)) A series-system reliability numerical (sub-marks 4 + 2 + 4 printed on the paper). All 6 chip types with the tabulated counts n_i and failure rates lambda_i must be fault-free, and all times to failure are exponential. Find (I) the system time-to-failure distribution (i.e. the system failure rate and reliability function R(t)), (II) the mean lifetime (MTTF), and (III) R(1000). (b) Three things are asked: (i) explain the minimax (and maximin) criterion in the theory of games; (ii) test the given 3 x 4 payoff matrix for stability, i.e. for the existence of a saddle point; and (iii) obtain the optimal (pure) strategies of both players and the value of the game. (c(i)) A basic deterministic EOQ numerical. With annual demand D = 10,000 units, ordering cost S = Rs 20 per order and holding cost C = 25 per cent of the Rs 25 acquisition cost, find (I) the economic order quantity and (II) the total inventory cost. Both sub-parts must be answered. (c(ii)) A 4 x 4 minimisation assignment problem. Using the Hungarian (Kuhn-Munkres) method, assign each of the 4 workers to exactly one of the 4 jobs so that total cost is minimum, and state the optimal assignment together with its total cost.
- Reference value / allowance / slack K = (delta/2) sigma = 0.5 sigma
- Decision interval H = h sigma, h = 4 or 5 (H = 5 sigma)
- C_i^+ = max[0, x_i - (mu_0 + K) + C_{i-1}^+]
- C_i^- = max[0, (mu_0 - K) - x_i + C_{i-1}^-]
- ARL_0 about 465 and ARL_1 about 10.4 for k = 0.5, h = 5
- V-mask: lead distance d, half-angle theta, H = d tan(theta)
- Series system: R_s(t) = product of component reliabilities
- lambda_s = sum n_i lambda_i = 1205.8496 per 10^6 hours
- lambda_s = 1.2058 x 10^-3 per hour
- System time-to-failure is exponential, R_s(t) = e^{-lambda_s t}
- MTTF = 829 hours
- R(1000) = 0.299 (about 29.9 per cent)
- Two-person zero-sum game, maximin and minimax criteria
- Row minima: -2, -1, -3; maximin = -1
- Column maxima: 1, 1, -1, 8; minimax = -1
- Saddle point at (A2, B3)
- Game is stable / strictly determined
- Optimal strategies A2 and B3; value of the game v = -1
- EOQ formula Q* = sqrt(2DS/C)
- C = 0.25 x 25 = Rs 6.25 per unit per year
- Q* = 252.98 ~ 253 units
- Total inventory cost = sqrt(2DSC) = Rs 1581.14
- At optimum ordering cost = carrying cost = Rs 790.57
- Hungarian (Kuhn-Munkres) assignment method
- Row reduction by row minima 2, 3, 1, 4
- Column reduction of column 1 by 3
- Minimum number of covering lines = order of matrix (4) is the optimality test
- Optimal assignment 1-2, 2-1, 3-3, 4-4
- Minimum total cost = Rs 13
(a) How will you draw the OC curve for a single sampling plan with sample size 5, if the acceptance number is c = 2, assuming the lot size to be large ? Explain. (15 marks)
(b) Each day, a sample of 50 items from a production process was examined. The number of defectives found in each sample was as follows :
6, 2, 5, 1, 2, 2, 3, 5, 3, 4, 12, 4, 4, 1, 3, 5, 4, 1, 4, 3, 5, 4, 2, 3.
Draw a suitable control chart and check for control. What control limits would you suggest for subsequent use ? (15 marks)
(c) (i) Distinguish between slack variables and surplus variables. Discuss how they are used in a linear programming problem. (5 marks)
(ii) Use the dual simplex method to solve the following Linear Programming Problem (LPP) :
Minimize Z = 2x₁ + x₂ + 3x₃
subject to
x₁ − 2x₂ + x₃ ≥ 4
2x₁ + x₂ + x₃ ≤ 8
x₁ − x₃ ≥ 0
and x₁ ≥ 0, x₂ ≥ 0, x₃ ≥ 0 (15 marks)
हिंदी में पढ़ें
(a) एकल प्रतिचयन योजना, जिसमें प्रतिदर्श आमाप 5, स्वीकृत संख्या c = 2 है, में यह मानते हुए कि प्रचय आमाप बहुत बड़ा है, आप प्रचालन अभिलक्षण वक्र (OC curve) कैसे बनाएँगे ? समझाइए । (15 अंक)
(b) उत्पादन प्रक्रिया से प्रतिदिन 50 वस्तुओं के प्रतिदर्श की जाँच की गई । प्रत्येक प्रतिदर्श में पाए गए दोषों की संख्या निम्नलिखित थी :
6, 2, 5, 1, 2, 2, 3, 5, 3, 4, 12, 4, 4, 1, 3, 5, 4, 1, 4, 3, 5, 4, 2, 3.
उपयुक्त नियंत्रण चार्ट बनाइए और नियंत्रण की जाँच कीजिए । आगे के उपयोग के लिए आप किन नियंत्रण सीमाओं का सुझाव देंगे ? (15 अंक)
(c) (i) न्यूनतापूरक (शिथिल) चरों और अधिशेष चरों के बीच अंतर स्पष्ट कीजिए । रैखिक प्रोग्रामन समस्या (एल पी पी) में इनका उपयोग कैसे किया जाता है, इस पर चर्चा कीजिए । (5 अंक)
(ii) निम्नलिखित रैखिक प्रोग्रामन समस्या (एल पी पी) को द्वैत सिम्प्लेक्स विधि से हल कीजिए :
Z = 2x₁ + x₂ + 3x₃ का न्यूनतमीकरण कीजिए
निम्न प्रतिबन्धों के अन्तर्गत :
x₁ − 2x₂ + x₃ ≥ 4
2x₁ + x₂ + x₃ ≤ 8
x₁ − x₃ ≥ 0
और x₁ ≥ 0, x₂ ≥ 0, x₃ ≥ 0 (15 अंक)
Answer approach & key points
(a) Explain how the operating characteristic (OC) curve of a single sampling plan with n = 5 and c = 2 is constructed when the lot size is large. The answer must state the sampling distribution to use (binomial, since N is large), give the acceptance-probability function, tabulate P_a for a range of incoming quality levels p, describe the plot, and interpret the curve (AQL, LTPD, producer's and consumer's risks, effect of n and c). (b) Three demands: (i) choose and construct the suitable control chart for 24 daily samples of constant size n = 50 with the number of defectives recorded - this is an np chart (equivalently a p chart); (ii) test whether the process is in statistical control; (iii) recommend revised control limits for subsequent use after eliminating any assignable cause. (c(i)) Distinguish slack from surplus variables and discuss the role each plays in formulating and solving a linear programming problem (conversion to standard form, starting basis, need for artificial variables, economic interpretation). (c(ii)) Solve the given minimisation LPP by the DUAL SIMPLEX method specifically - convert all constraints to the 'less than or equal to' form, set up a dual-feasible but primal-infeasible starting tableau, and iterate using the dual-simplex leaving-then-entering rule until primal feasibility is attained. State the optimal x1, x2, x3 and Z.
- Type-B OC curve; binomial model justified by large lot size
- P_a(p) = (1-p)^5 + 5p(1-p)^4 + 10p^2(1-p)^3
- Table of P_a: 0.9988 at p = 0.05; 0.9914 at 0.10; 0.9421 at 0.20; 0.8369 at 0.30; 0.5000 at 0.50
- AQL, LTPD, producer's risk alpha, consumer's risk beta
- Ideal OC curve is a vertical step; finite n makes the curve flat
- np chart (or p chart) with constant n = 50
- Sum of defectives = 88, p-bar = 0.0733, n p-bar = 3.667
- Trial UCL = 9.20, LCL = 0
- Sample 11 (12 defectives) is out of control
- Revised n p-bar = 3.304, UCL = 8.57, LCL = 0 (p-chart: p-bar = 0.0661, UCL = 0.1715)
- 3-sigma limits based on the binomial standard deviation
- Slack added to 'less than or equal to'; surplus subtracted from 'greater than or equal to'
- Both >= 0, zero coefficient in the objective function
- Slack columns form the identity matrix / initial basic feasible solution
- Artificial variable, Big-M (penalty) method, Two-Phase method
- Complementary slackness / shadow price interpretation
- Dual simplex: start dual feasible (c_j - z_j >= 0) and primal infeasible (negative RHS)
- Multiply 'greater than or equal to' rows by -1; slacks s1, s2, s3; no artificial variables needed
- Leaving variable = most negative basic value (s1 = -4)
- Entering variable = min |(c_j - z_j)/a_rj| over negative a_rj only; x1 enters with ratio 2
- Optimal x1 = 4, x2 = 0, x3 = 0
- Z_min = 8
(a) (i) Discuss the theoretical basis of the sequential probability ratio test (SPRT) in acceptance sampling. Explain how acceptance and rejection numbers are chosen to satisfy α and β risks. (15 marks)
(ii) Ten units are tested for 200 hours. Failures occur at 50, 80, 120, and 150 hours (4 failures). Assume that the lifetimes are exponentially distributed with type-I censoring. Find the MLE of λ̂, where λ denotes the failure rate. (5 marks)
(b) (i) What is a Transportation problem ? Give a general mathematical model of a transportation problem. (5 marks)
(ii) Use Vogel’s approximation method to solve the following transportation problem :
Distribution Centre
Plant D₁ D₂ D₃ D₄ Capacity
P₁ 2 3 11 7 6
P₂ 1 0 6 1 1
P₃ 5 8 15 9 10
Demand 7 5 3 2 (10 marks)
(c) (i) Define a Poisson process and state at least three applications of the same. (5 marks)
(ii) In a local post office, a particular service is operated by one person. The arrival pattern of customers on a particular day follows a Poisson distribution with a mean arrival rate of 10 people per hour. Customers are served on a First-Come, First-Served (FCFS) basis and the service time is estimated to be exponentially distributed with an average time of 4 minutes. Determine :
(I) Probability (there is no queue)
(II) The average size of the queue
(III) The expected waiting time in the queue
(IV) Probability (a customer will spend less than 12 minutes in the queue) (10 marks)
हिंदी में पढ़ें
(a) (i) स्वीकृतिकरण प्रतिचयन में अनुक्रमिक प्रायिकता अनुपात परीक्षण (SPRT) के सैद्धांतिक आधार की चर्चा कीजिए। यह समझाइए कि α तथा β जोखिमों को संतुष्ट करने के लिए स्वीकृत एवं अस्वीकृत संख्याओं का चयन कैसे किया जाता है। (15 अंक)
(ii) दस इकाइयों का 200 घंटे तक परीक्षण किया गया। 50, 80, 120 और 150 घंटों पर विफलताएँ हुईं (4 विफलताएँ)। यह मानते हुए कि जीवनकाल टाइप-I सेंसरिंग (प्रथम प्रकार का सेंसर) के साथ चरघातांकी रूप से बंटित है, λ̂ का अधिकतम संभाविता आकलक (MLE) ज्ञात कीजिए, जहाँ λ विफलता दर को दर्शाता है। (5 अंक)
(b) (i) परिवहन समस्या क्या है ? परिवहन समस्या का एक सामान्य गणितीय प्रतिरूप प्रस्तुत कीजिए। (5 अंक)
(ii) निम्नलिखित परिवहन समस्या को हल करने के लिए वोगेल की सन्निकटन विधि का उपयोग कीजिए :
वितरण केन्द्र
संयंत्र D₁ D₂ D₃ D₄ क्षमता
P₁ 2 3 11 7 6
P₂ 1 0 6 1 1
P₃ 5 8 15 9 10
माँग 7 5 3 2 (10 अंक)
(c) (i) प्वासों प्रक्रिया को परिभाषित कीजिए और इसके कम-से-कम तीन अनुप्रयोग बताइए । (5 अंक)
(ii) एक स्थानीय डाकघर में, एक विशेष सेवा एक व्यक्ति द्वारा संचालित की जाती है । एक विशेष दिन ग्राहकों के आगमन का प्रतिरूप प्वासों बंटन का अनुसरण करता है, जिसमें प्रति घंटे औसतन 10 लोग आते हैं । ग्राहकों को पहले आओ, पहले पाओ (FCFS) के आधार पर सेवा दी जाती है और सेवा देने में लगने वाला समय चरघातांकी रूप से बंटित होने का अनुमान है, जिसका औसत समय 4 मिनट है । ज्ञात कीजिए :
(I) प्रायिकता (कोई पंक्ति नहीं है)
(II) पंक्ति का औसत आकार
(III) पंक्ति में प्रतीक्षा का अनुमानित समय
(IV) प्रायिकता (ग्राहक को पंक्ति में 12 मिनट से भी कम समय बिताना पड़ेगा) (10 अंक)
Answer approach & key points
(a(i)) Two linked demands: (i) set out the theoretical basis of Wald's sequential probability ratio test as applied to acceptance sampling by attributes, and (ii) explain precisely how the acceptance and rejection numbers (the two boundary lines) are determined so that the producer's risk alpha and consumer's risk beta are met. (a(ii)) Obtain the maximum likelihood estimate of the exponential failure rate lambda from a type-I (time-truncated) censored life test: 10 units placed on test for a fixed 200 hours, 4 failures observed at 50, 80, 120 and 150 hours, the remaining 6 units still running at truncation. (b(i)) Two parts: state what a transportation problem is (its structure and purpose), and write down its general mathematical model - objective function, supply constraints, demand constraints, non-negativity and the balance condition. (b(ii)) Solve the given 3 x 4 balanced transportation problem using Vogel's Approximation Method to obtain the initial basic feasible solution, and complete the solution by testing optimality (MODI / u-v method) and improving if necessary; state the final allocation and minimum cost. (c(i)) Give a formal definition of a Poisson process (its postulates or equivalent characterisations) and state at least three genuine applications. (c(ii)) A single-server M/M/1 queue with Poisson arrivals at 10 per hour and exponential service averaging 4 minutes, FCFS and infinite capacity. Compute four quantities: (I) the probability that there is no queue, (II) the average queue size, (III) the expected waiting time in the queue, and (IV) the probability that a customer spends less than 12 minutes in the queue.
- Wald's sequential probability ratio test (SPRT), 1943-47
- H0: p = p1 (AQL), H1: p = p2 (LTPD)
- A = (1 - beta)/alpha, B = beta/(1 - alpha)
- Acceptance line d = s n - h1, rejection line d = s n + h2
- s = ln[(1-p1)/(1-p2)] / ln[p2(1-p1)/(p1(1-p2))]
- h1 = ln[(1-alpha)/beta] / ln[p2(1-p1)/(p1(1-p2))], h2 = ln[(1-beta)/alpha] / ln[...]
- Wald-Wolfowitz optimality; ASN; truncation
- Type-I (time-truncated) censoring; censored contribution e^{-lambda T0}
- L(lambda) = lambda^r e^{-lambda T}
- lambda-hat = r/T = number of failures / total time on test
- T = 400 + 6(200) = 1600 unit-hours
- lambda-hat = 0.0025 per hour; MTTF = 400 hours
- m origins with supplies a_i, n destinations with demands b_j, unit costs c_ij, decision variables x_ij
- Minimise Z = sum_i sum_j c_ij x_ij
- sum_j x_ij = a_i; sum_i x_ij = b_j; x_ij >= 0
- Balance condition sum a_i = sum b_j; dummy origin/destination with zero cost
- m + n - 1 basic cells; a special LPP solved by NWCR/LCM/VAM then MODI
- Balanced problem: total supply = total demand = 17
- Vogel's Approximation Method penalties = difference between the two lowest costs in a row/column
- VAM allocations: (P2, D4) = 1, (P1, D2) = 5, (P1, D1) = 1, (P3, D1) = 6, (P3, D3) = 3, (P3, D4) = 1
- VAM initial cost = Rs 102
- MODI / u-v optimality test, opportunity cost d_ij = c_ij - u_i - v_j
- Optimal cost = Rs 100 with x12 = 5, x13 = 1, x23 = 1, x31 = 7, x33 = 1, x34 = 2
- Independent and stationary increments; orderliness (no simultaneous events)
- P[N(t) = n] = e^{-lambda t}(lambda t)^n/n!
- E[N(t)] = Var[N(t)] = lambda t
- Exponential inter-arrival times with mean 1/lambda
- Three applications: queueing arrivals, radioactive decay, reliability/failures (or insurance claims, defects per unit)
- M/M/1 model, FCFS, lambda = 10/hour, mu = 15/hour, rho = 2/3
- P(no queue): P₀ = 1 − ρ = 1/3 (server idle), or P(N ≤ 1) = 1 − ρ² = 5/9 if read as 'nobody waiting' — interpretation stated
- Lq = rho^2/(1 - rho) = 1.33 customers (Ls = 2)
- Wq = 2/15 hour = 8 minutes (Ws = 12 minutes)
- P(Wq > t) = rho e^{-(mu - lambda)t}; P(Wq < 12 min) = 0.755
- P(W_system < 12 min) = 1 - e^{-1} = 0.632