https://orcid.org/0000-0003-4732-7994
![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
We present here a simple probabilistic approach for determining an optimal progressive censoring scheme by defining a probability structure on the set of feasible solutions. Given an initial solution, the new updated solution is computed within the probabilistic structure. This approach will be especially useful when the cardinality of the set of feasible solutions is large. The validation of the proposed approach is demonstrated by comparing the optimal scheme so determined with the one obtained by exhaustive numerical search.
Acknowledgments
The authors express their sincere thanks to two anonymous referees and an associate editor for their critical comments and valuable suggestions which have resulted in an improvement over the earlier version of the manuscript. The second author thanks the National Sciences and Engineering Research Council of Canada for supporting this research through an Individual Discovery Grant RGPIN-2020-06733.