Optimal one-step censoring schemes under entropy criterion

Abstract

Finding the optimal censoring scheme is a discrete optimization problem in the space of schemes. Under the entropy criterion, we examine optimal censoring schemes by preferring the choice of one-step censoring schemes as suggested by Balakrishnan. Exact one step optimal schemes for distributions with decreasing failure rate under entropy criterion are specified by Cramer and Bagh. We consider the distributions with increasing, right tailed and bath tub failure rates and compare the entropy of the one-step censoring schemes with the optimal ones, and observed that the loss in entropy is very negligible.

Keywords:

• Entropy
• Order statistics
• Progressive censoring scheme
• Type II censoring

1991 Mathematics Subject Classification:

• 62E15
• 94A17
• 62N01

Acknowledgments

The author is thankful to Professor Adnan Awad for his guidance and help in developing the algorithm in Mathematica and to the anonymous reviewer for constructive suggestions to correct and improve the manuscript.