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

Alan R. Washburn
Additional contact information
Alan R. Washburn: Naval Postgraduate School, Monterey, California

Operations Research, 1981, vol. 29, issue 6, 1227-1230

Abstract: 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.

Keywords: 452; 751 an upper bound on detection probability (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.6.1227 (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:29:y:1981:i:6:p:1227-1230

Access Statistics for this article

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