The discrete search problem and the construction of optimal allocations

Ingo Wegener

Naval Research Logistics Quarterly, 1982, vol. 29, issue 2, 203-212

Abstract: Suppose one object is hidden in the k‐th of n boxes with probability p(k). The boxes are to be searched sequentially. Associated with the j‐th search of box k is a cost c(j,k) and a conditional probability q(j,k) that the first j ‐ 1 searches of box k are unsuccessful while the j‐th search is successful given that the object is hidden in box k. The problem is to maximize the probability that we find the object if we are not allowed to offer more than L for the search. We prove the existence of an optimal allocation of the search effort L and state an algorithm for the construction of an optimal allocation. Finally, we discuss some problems concerning the complexity of our problem.

Date: 1982
References: Add references at CitEc
Citations:

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

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:29:y:1982:i:2:p:203-212

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 ().