The construction of an optimal distribution of search effort

Ingo Wegener

Naval Research Logistics Quarterly, 1981, vol. 28, issue 4, 533-543

Abstract: Suppòse one object is hidden in the k‐th of n boxes with probability p(k). We know the probability q(t, k) of detecting the object if it is hidden in box k and we expend effort t searching box k. Our aim is to minimize the expected search effort of a successful search. Previously this problem has been solved only under the assumption that the functions q(·, k) are concave. We prove, without concavity assumptions, the existence of an optimal distribution of search effort and give a procedure for its construction.

Date: 1981
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800280403

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:wly:navlog:v:28:y:1981:i:4:p:533-543

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().