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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1969
Accession Number
AD0693640

Entities

People

  • Richard W. Butterworth

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • C4I
  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Computational Complexity
  • Computations
  • Computer Programming
  • Computer Programs
  • Computers
  • Dynamic Programming
  • Equations
  • Mathematics
  • Notation
  • Operations Research
  • Probability
  • Random Variables
  • Sequences
  • Specifications

Fields of Study

  • Computer science

Readers

  • Operations Research
  • Systems Analysis and Design