In order to study the problem of detecting an optimal sequence of random audits, this paper is devoted to determine a checking schedule minimizing the expected total cost resulting from the inspections and the possible first failure. This is achievable because in this case the control function is associated to the rate of growth of the checking intensity.
⚡ This is an original paraphrased summary — not copied from the abstract. Full paper available at the source link below.
Mathematical breakthroughs form the theoretical backbone of science, cryptography, data analysis, and engineering.
This summary is based on publicly available metadata and abstract. For the full research paper, visit the original source:
Read Full Paper at OpenAlex