Upper and lower bounds for a pattern bombing problem

Alan R. Washburn

Naval Research Logistics Quarterly, 1974, vol. 21, issue 4, 705-713

Abstract: This paper includes two simple analytic formulas for kill probability that are applicable in circumstances where shots should be fired in a pattern. The two formulas bracket the maximum kill probability achievable with an optimal pattern. The upper bound corresponds to an optimal nonfeasible pattern, and the lower bound to a nonoptimal feasible pattern.

Date: 1974
References: Add references at CitEc
Citations:

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

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:21:y:1974:i:4:p:705-713

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