Two Numerical Methods for Computing the Probability of Outcome of a Battle of Lanchester Type
Methods are developed for the computation of victory probabilities in the classical Lanchester 'modern warfare' model. The first method employs a bivariate normal approximation for state probabilities and a kind of steepest descents technique for the evaluation of the integral: the second...
Veröffentlicht in: | The Journal of the Operational Research Society. - Taylor & Francis, Ltd.. - 43(1992), 8, Seite 797-807 |
---|---|
1. Verfasser: | |
Format: | Online-Aufsatz |
Sprache: | English |
Veröffentlicht: |
1992
|
Zugriff auf das übergeordnete Werk: | The Journal of the Operational Research Society |
Schlagworte: | Lanchester Theory Probability of Victory Numerical Methods Computational Analysis Military Moments Battles Mathematics Political science Behavioral sciences |
Zusammenfassung: | Methods are developed for the computation of victory probabilities in the classical Lanchester 'modern warfare' model. The first method employs a bivariate normal approximation for state probabilities and a kind of steepest descents technique for the evaluation of the integral: the second proposes a truncated binomial approximation along certain diagonal lines. Both methods depend on moments. Computational performance is discussed. |
---|---|
ISSN: | 14769360 |
DOI: | 10.2307/2583098 |