Incremental approximation of optimal allocations

Lawrence D. Stone

Naval Research Logistics Quarterly, 1972, vol. 19, issue 1, 111-122

Abstract: This paper concerns the approximation of optimal allocations by δ allocations. δ allocations are obtained by fixing an increment δ of effort and deciding at each step upon a single cell in which to allocate the entire increment. It is shown that δ allocations may be used as a simple method of approximating optimal allocations of effort resulting from constrained separable optimization problems involving a finite number of cells. The results are applied to find δ allocations (called δ plans) which approximate optimal search plans. δ plans have the property that as δ → 0, the mean time to find the target using a δ plan approaches the mean time when using the optimal plan. δ plans have the advantage that. they are easily computed and more easily realized in practice than optimal plans which tend to be difficult to calculate and to call for spreading impractically small amounts of effort over large areas.

Date: 1972
References: Add references at CitEc
Citations:

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

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:19:y:1972:i:1:p:111-122

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