Optimizing fire allocation in a Network Centric Warfare-type model

Nam H Nguyen, My A Vu, Anh N Ta, Dinh V Bui and Manh D Hy

The Journal of Defense Modeling and Simulation, 2022, vol. 19, issue 4, 691-701

Abstract: In this paper, we introduce a non-linear Lanchester’s model of Network Centric Warfare type and investigate an optimization problem for this model, where only the Red force is supplied by several supply agents. Optimal fire allocation of the Blue force is sought in the form of a piece-wise constant function of time. A “threatening rate†is computed for the Red force and each of its supply agents at the beginning of each stage of the combat. These rates can be used to derive the optimal decision for the Blue force to focus its firepower to the Red force itself or one of its supply agents. This optimal fire allocation is derived and proved by considering an optimization problem of the number of Blue force troops. Numerical experiments are included to demonstrate the theoretical results.

Keywords: Non-linear Lanchester’s model; Network Centric Warfare; optimal fire allocation; optimization problem; piece-wise constant function; optimal strategy (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1177/15485129211022861 (text/html)

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:sae:joudef:v:19:y:2022:i:4:p:691-701

DOI: 10.1177/15485129211022861

Access Statistics for this article

More articles in The Journal of Defense Modeling and Simulation
Bibliographic data for series maintained by SAGE Publications ().