Professional Documents
Culture Documents
Reliability Concepts: in Discrete Time
Reliability Concepts: in Discrete Time
5.1 Preliminaries
failure rate.
Definition 5.1.
class if
Theorem 5.1.
Proof:
R
R x+1
x+y+_ R
RX) > for all y in I.
, 0,
x+y
130
Hence,
R x+1 R x+ +1
R(x) >I- R x+y
and
R x+1 1- R x+ +1
R x R x+y
Theorem 5.2.
defined by,
x+y-l
H(x,y) = E h ( t), x >, 0.
t=x
Proof:
1 x+y x+y-1
H(x+l,y)-H(x,y) = E y - 1 E h(t), (5.2)
x+ t_y x t=y
x+y-1
x+1 - X tE h(t) + hx+1
Y
x+y-1
x+1
1 [h(x+y) - X E h(t) J.
t=y
1 x+y-1
E h(t) < h (x+y-1),
x t =Y
and therefore,
0.
gives,
x+y x+y-1
x E h(t) >, (x+l) E h(t),
x x
or
x+y-1
xh(x+y) >,, E h(t).
x
132
Hence,
and
Theorem 5.3.
Proof:
or
1 - kkx i "< 0.
Therefore,
k(x+1)+1 - k
k x+l
x < k(x+l) ,
and
that this class (1) limiting case of no wear ; that is, all
exponential distributions, (2) preserves the wearing out
x
x log F (x) = x f h(t)dt
0
Definition 5.2.
x 1 x-1
x+l E h(t) x E h(t) ,
t=o t=o
135
5.3.1 Properties
section we conclude
Theorem 5.4.
distributions.
Theorem 5.5.
If X is IFRA then
Proof:
x
x+1 E h(t) - X xEh(t)
l >, 0,
t=o t=o
or
1 x R t+l l x-1 R t+1 ]> 0
MI E [1 R t x E [1 R(t)
t=o t=o
or
or
violated for the IFRA class for atleast one y, say, y=1.
This implies
1 x-1 R t+1
x
o f 4. A O(nA ,
t -o
nd
1- 1
x R t+l < 1- R(l)
x t=o R(t) R 0
137
Since,
R t+l = 1-h(t) ,
R t
is proved.
Theorem 5.6.
Proof:
Theorem 5.5,
Then,
That is ,
M
R(x+l) r ( o) R(1) >, E R(t),
Y+ 1
or
CO
R(1) >i R x+1 t=x+l R(t) ,
this gives
Theorem 5.7.
x
Y is IFRA if and only if x+1 E is an
0
Proof:
(4.13).
Definition 5.3.
5.4.1. Properties.
Theorem 5.7.
of x, for every y in I.
Proof:
CO CO
1
1 E R(x+y+l) or E R(y)
R x+1) y-o R( x+1) x+l
Corollary 5.1.
Corollary 5.2.
following example.
X 0 1 2 3 4
Theorem 5.8.
DMRL is that
inequalities.
Proof:
We have
EY 2 = 1 E (y-x)2 f(x) ,
x R x+l) y=x+l
_ 1 E n2 f (x+n) ,
= R x+l) 1
CO
1+ R x+l ) E (2n+1 ) R(x+n+l) . (5.4)
1
Also,
EY = 1 E R (x+n) ,
x R x+1) n=l
00
EYx2-r(x) - 2 E n R (x+n+1),
R x+1) n=1
_ 2 CO CO ]
2 00
00
2
R x+1 E R(t+1) r(t)-2r(x),
x
00
R2 x+1 E R(t+1) [r(t)-r(x)]+ 2r(x)-2r(x).
2
x
Hence,
00
EYx2 + EYx 2[EYx]2 - (t+l)[r(t)- r(x)].
R ( 2x+1) E R
x
If X has DMRL,
x > 0,
r(x)-r(x+l) = l1+C
C
follows that
implies
Theorem 5.9.
Proof:
and therefore,
consequently X is DMRL.
Theorem 5.10.
Proof:
implies
For C> 1, we thus have r(x) < r(x+l) and hence M'RL is an
146
Definition 5.4.
Definition 5.5.
other words, the new unit is better than the used one or
than the expected life of a new unit so that the new unit
geometric law,
Definition 5.6.
00 00
1 )x,
E R(t+l) \< E G(t+l) = m(1-
t=x t=x
to y from O to m.
2. X is NBU if and only if k(x) > k(o). (We use the defini-
1
tion of NBUE and the relationship k(x) =r .)
149
x
3. X is HNBUE if and only if x E k(t) >, k(o) for x=1,2,...
t=1
x
5. Y is HNBUE if and only if h(o ) < X E h(t).
t=1
We have also,
Theorem 5.11.
Proof:
CO
m[1- m]x >^ E R(x+l) .
0
Accordingly X is HNBUE.
150
Theorem 5.12.
E(X(1))-1
where X (j) X.
(1) 1<ii<n 1
Proof:
Now,
P[X(1)>,x] _ [R(x) ]n
_ [(l- m)n]x-1
151
m-1 ) n
m
as stated.
can write,
CO
E [R(x)]n
00
E R(x) [R (x)]n-1
1
CO
E R(x) [ fi(x )- Q(x-1)],
1
where,
x
L(x) = E [R(t) ]n-1
t=o
152
Therefore,
E
x=1
N X) f(x),
where,
f(x) = P[Xi=x],
= R(x)-R(x+1).
Defining,
x
E (1- 1)(n-1)t
h(x)
t=o m
00
E R(x) \< m(1- m) t,
x=t+1
00
E (1 m
)x ,
t+ 1
or
cc t
E R(x) >^ E (1- 1 x-1
x=o x=1
153
Also,
2 - E (1-m2x
E [R(x)] E [R(x)-(l-
= x-1
m) ]R(x) +
x=l x=l x=1
Therefore,
Then,
CO 00
E(X(1)) = E Q(x)f(x) E h(x)f(x),
x=1 x=l
- 1)(x-1)]f(x),
E [ E (1- m)(n
x=l t=l
CO
[m(l_ 1)(n-1)(x-1)] R(x) ,
m m
x=1
= EO(Y),
where,
= m(1- 1)(n-1)(x-1)
0(Y)
154
By Theorem 5.11,
1-(1- m)n
R(x) )x-1,
m
5.6 Conclusion