Annihilation Prediction for Lanchester Type Models of Modern Warfare
Article Abstract:
Important new functions for analytic solution of Lanchester-type equations of modern warfare for combat between homogeneous forces are introduced. These forces are modeled by power attrition-rate coefficients with no offset. Tabulations of these Lanchester- Clifford-Schlafli (or LCS) functions allow one to study this particular variable-coefficient model almost as easily and thoroughly as Lanchester's classic constant-coefficient one. LCS functions allow one to obtain force-annihilation prediction without having to spend the time and effort of computing force-level trajectories. The new LCS functions also provide information about related variable-coefficient models. A transformation of the battles' time scale simplifies the force-level equations and shows relative fire effectiveness and intensity of combat. A diagram of Border's constant-speed attack model is shown.
Publication Name: Operations Research
Subject: Petroleum, energy and mining industries
ISSN: 0030-364X
Year: 1983
User Contributions:
Comment about this article or add new information about this topic:
Computational Issues in an Infinite-Horizon, Multiechelon Inventory Model
Article Abstract:
A two-echelon inventory system is described. The higher echelon is a single location called a depot and the lower echelon system is also a single point called a retail outlet. Results are extended to the infinite-horizon case. Multiple locations at the lower echelon are also considered.
Publication Name: Operations Research
Subject: Petroleum, energy and mining industries
ISSN: 0030-364X
Year: 1984
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Last resort for the Mediterranean. Sands of time. Funds in fragile places
- Abstracts: GE, Toshiba team for H technology. Caterpillar maneuvers for world market share. Fly ash carbon cutting technology debuts
- Abstracts: Randomization Procedures in the Computation of Cumulative-Time Distributions Over Discrete Stare Markov Process
- Abstracts: Resource Allocation with Tree Constraints. On Min-Max Integer Allocation Problems. Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time