Mathematical Methods of Operations Research

, Volume 68, Issue 3, pp 539–549 | Cite as

Optimal discrete search with imperfect specificity

Original Article


A target is hidden in one of several possible locations, and the objective is to find the target as fast as possible. One common measure of effectiveness for the search process is the expected time of the search. This type of search optimization problem has been addressed and solved in the literature for the case where the searcher has imperfect sensitivity (possible false negative results), but perfect specificity (no false positive detections). In this paper, which is motivated by recent military and homeland security search situations, we extend the results to the case where the search is subject to false positive detections.


Discrete search Imperfect specificity uniformly optimal 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Ahlswede R, Wegener I (1987) Search problems. Wiley, New YorkMATHGoogle Scholar
  2. Black WL (2004) Discrete sequential search. Inf Control 8: 159–162CrossRefMathSciNetGoogle Scholar
  3. Chew MC (1967) A sequential search procedure. Ann Math Stat 38: 494–502MATHCrossRefMathSciNetGoogle Scholar
  4. Chew MC (1973) Optimal stopping in a discrete search problem. Oper Res 21(3): 741–747MATHCrossRefMathSciNetGoogle Scholar
  5. Danskin JM (1962) A theory of reconnaissance: I, ii. Oper Res 10(3): 285–309CrossRefMathSciNetGoogle Scholar
  6. Kadane JB (1971) Optimal whereabout search. Oper Res 19: 894–904MATHCrossRefMathSciNetGoogle Scholar
  7. Matula D (1964) A periodic optimal search. Amer Math Mon 71: 15–21MATHCrossRefMathSciNetGoogle Scholar
  8. Pollock SM (1971) Serch detection and subsequent action: some problems on the interfaces. Oper Res 19: 559–586MATHCrossRefGoogle Scholar
  9. Ross SM (1983) Introduction to stochastic dynamic programming. Academic Press, AmsterdamMATHGoogle Scholar
  10. Song N-O, Teneketzis D (2004) Discrete search with multiple sensors. Math Meth Oper Res 60: 1–13MATHCrossRefMathSciNetGoogle Scholar
  11. Stone LD (1975) Theory of optimal search. Academic Press, AmsterdamMATHGoogle Scholar
  12. Wegener I (1980) The discrete sequential search problem with nonrandom cost and overlook probabilities. Math Oper Res 5: 373–380MATHCrossRefMathSciNetGoogle Scholar
  13. Wegener I (1980) Optimal search with positive switch cost is np-hard. Inf Process Lett 21: 49–52CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag 2007

Authors and Affiliations

  1. 1.Operations Research DepartmentNaval Postgraduate SchoolMontereyUSA

Personalised recommendations