摘要
设有由K个成败型元件A1,A2,…,Ak组成的串联系统,设A1,A2,…,Ak之间有相依关系,要A1成功的条件下A2才可以试验,在A1,A2,都成功的条件下A3才可以试验,…在A1,A2…,Ak-1都成功的条件下Ak才可以试验,设条件概率P(Ai|A1A2…Ai-1)=pi,pi未知,i=1,2…,K。设有样本(X1,X2,…。Xk)本文用样本点排序法求此串联系统可靠性之经典精确置信下限,并证明了此置信限之最优性。
Let {A1, A2, … ,Ak} be a series system consisting of pass-fail component A1 , A2, … , AK. Suppose that one can test Ai if and only if tests A1,A2, … , Ai-1 success.Set P(A1) = p1, P(A2| A1) = p2, … , P(Ai| A1A2 … Ai-1) = pi, … , P(Ak| A1A2 … Ak-1)= pk and the p1, p2, …,pK are unknown. Suppose that there is the sample (X1, X2, … ,Xk) if one makes n tests.In this paper, we discuss the classical exact optimal confidence limits of reliability R = p1p2 … pk, and prove that this confidence limits is the best.
出处
《应用数学学报》
CSCD
北大核心
1995年第4期601-607,共7页
Acta Mathematicae Applicatae Sinica
关键词
成败型元件
串联系统
可靠性
置信限
置信下限
Pass-fail component, series system, reliability,classical exact lower confidence limit