Incremental approximation of optimal allocations

✍ Scribed by Lawrence D. Stone

• Publisher: John Wiley and Sons
• Year: 1972
• Tongue: English
• Weight: 530 KB
• Volume: 19
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/nav.3800190109

✦ Synopsis

This paper concerns the approximation of optimal allocations by A allocations. A allocations are obtained by fixing an increment A of effort and deciding at each step upon a single cell in which to allocate the entire increment. It is shown that A 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 A allocations (called A plans) which approximate optimal search plans. A plans have the property that as A + 0, the mean time to find the target using a A plan approaches the mean time when using the optimal plan. A 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.