Technical Note—An Upper Bound Useful in Optimizing Search for a Moving Target

A feasible solution always establishes a lower bound on the maximum value of an objective function. In the class of problems considered here, the objective function is detection probability, and it is shown how successive feasible methods of searching also establish a sequence of nondecreasing upper bounds on the maximum detection probability.