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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Communications in Statistics - Simulation and Computation
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
