A Computational Procedure for a Class of Coverage Problems for Multiple Shots

Harold J. Breaux and Lynn S. Mohler
Additional contact information
Harold J. Breaux: U.S. Army Aberdeen Research and Development Center, Aberdeen Proving Ground, Maryland
Lynn S. Mohler: U.S. Army Aberdeen Research and Development Center, Aberdeen Proving Ground, Maryland

Operations Research, 1971, vol. 19, issue 3, 636-644

Abstract: This paper considers certain computational difficulties associated with a class of coverage problems for multiple shots, including the situation where N rounds of a salvo are delivered onto a diffused target, where the single-round damage function, the distribution of impacts about the aim point, and the distribution of aim point about the target center are elliptical normal. The computational procedure employs Jacobi polynomials and results in better convergence properties of the resulting series than for series heretofore employed.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.3.636 (application/pdf)

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:inm:oropre:v:19:y:1971:i:3:p:636-644

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().