Optimal fire allocation in a combat model of mixed NCW type
Abstract
In this work, we introduce a nonlinear Lanchester model of NCW-type and study a problem of finding the optimal fire allocation for this model. A Blue party will fight against a Red party consisting of and , where is an independent force and fights with supports from a supply unit . A battle may consist of several stages but we consider the problem of finding optimal fire allocation for in the first stage only. Optimal fire allocation is a set of three non-negative numbers whose sum equals to one, such that the remaining force of is maximal at any instants. In order to tackle this problem, we introduce the notion of \textit{threatening rates} which are computed for at the beginning of the battle. Numerical illustrations are presented to justify the theoretical findings.
Cite
@article{arxiv.2104.02983,
title = {Optimal fire allocation in a combat model of mixed NCW type},
author = {My A. Vu and Nam H. Nguyen and Hanh Le T. Nguyen and Anh N. Ta and Mong H. Nguyen},
journal= {arXiv preprint arXiv:2104.02983},
year = {2021}
}