In this paper, we consider the missing information in determining the optimal allocation of removals in a Type II progressive censoring scheme. We provide a simple expression and a recurrence relation for the missing information. Then we provide a simple way of determining an optimal censoring scheme among a class of one-step censoring by using the missing information. Finally we give some examples to illustrate our results.
|Number of pages||7|
|Journal||Statistics and Probability Letters|
|Publication status||Published - 2012 Feb|
Bibliographical noteFunding Information:
The authors are grateful to an anonymous referee for making some useful comments on an earlier version of this manuscript. This work was supported by the National Research Foundation of Korea Grant funded by the Korean Government ( NRF-2011-013-C00011 ).
All Science Journal Classification (ASJC) codes
- Statistics and Probability
- Statistics, Probability and Uncertainty