Technical Note—Threshold Probabilities when Searching for a Moving Target

Paul J. Schweitzer
Additional contact information
Paul J. Schweitzer: Institute for Defense Analyses, Arlington, Virginia

Operations Research, 1971, vol. 19, issue 3, 707-709

Abstract: Pollock has examined a model of search for a target whose transitions between two regions are described by a two-state stationary Markov chain. The minimum-search policy is characterized by a threshold probability π* that determines which region to search next. This note presents a simple recursive procedure for calculating π*.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.3.707 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:19:y:1971:i:3:p:707-709

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().