Chapter 9: Problem 15
Compute upper and lower bounds of the reliability function (using Method 2) fo the systems given in Exercise 4, and compare them with the exact values whe \(p_{i} \equiv \frac{1}{2}\)
Chapter 9: Problem 15
Compute upper and lower bounds of the reliability function (using Method 2) fo the systems given in Exercise 4, and compare them with the exact values whe \(p_{i} \equiv \frac{1}{2}\)
All the tools & learning materials you need for study success - in one app.
Get started for freeLet \(F\) be a continuous distribution function. For some positive \(\alpha\), define the distribution function \(G\) by $$ \bar{G}(t)=(\bar{F}(t))^{\alpha} $$ Find the relationship between \(\lambda_{G}(t)\) and \(\lambda_{F}(t)\), the respective failure rate functions of \(G\) and \(F\).
Let \(X\) denote the lifetime of an item. Suppose the item has reached the age of \(t\). Let \(X_{t}\) denote its remaining life and define $$ \bar{F}_{t}(a)=P\left\\{X_{t}>a\right\\} $$ In words, \(\bar{F}_{t}(a)\) is the probability that a \(t\) -year-old item survives an additional time \(a\). Show that (a) \(\bar{F}_{t}(a)=\bar{F}(t+a) / \bar{F}(t)\) where \(F\) is the distribution function of \(X\). (b) Another definition of IFR is to say that \(F\) is IFR if \(\bar{F}_{t}(a)\) decreases in \(t\), for all \(a\). Show that this definition is equivalent to the one given in the text when \(F\) has a density.
For any structure function, we define the dual structure \(\phi^{\mathrm{D}}\) by $$ \phi^{\mathrm{D}}(\mathbf{x})=1-\phi(\mathbf{1}-\mathbf{x}) $$ (a) Show that the dual of a parallel (series) system is a series (parallel) system. (b) Show that the dual of a dual structure is the original structure. (c) What is the dual of a \(k\) -out-of- \(n\) structure? (d) Show that a minimal path (cut) set of the dual system is a minimal cut (path) set of the original structure.
Prove Lemma \(9.3 .\) Hint: Let \(x=y+\delta\). Note that \(f(t)=t^{\alpha}\) is a concave function when \(0 \leqslant\) \(\alpha \leqslant 1\), and use the fact that for a concave function \(f(t+h)-f(t)\) is decreasing in \(t\).
Prove the combinatorial identity $$ \left(\begin{array}{c} n-1 \\ i-1 \end{array}\right)=\left(\begin{array}{c} n \\ i \end{array}\right)-\left(\begin{array}{c} n \\ i+1 \end{array}\right)+\cdots \pm\left(\begin{array}{l} n \\ n \end{array}\right), \quad i \leqslant n $$ (a) by induction on \(i\) (b) by a backwards induction argument on \(i\) -that is, prove it first for \(i=n\), then assume it for \(i=k\) and show that this implies that it is true for \(i=k-1\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.