A BRANCH AND BOUND METHOD FOR OPTIMAL FAULT FINDING
- 1 August 1969
- report
- Published by Defense Technical Information Center (DTIC)
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.Keywords
This publication has 0 references indexed in Scilit: