A BRANCH AND BOUND METHOD FOR OPTIMAL FAULT FINDING

Abstract
The problem is that of optimally testing a coherent system to learn some characteristic of it, for example, whether it is operating or not. A branch and bound and a dynamic programming solution are given, as well as a comparison of computer computation times for both. Several specific models with analytical solutions are also presented.