Optimization in a non-linear Lanchester-type model involving supply units

In this paper, a non-linear Lanchester-type model involving supply units is introduced. The model describes a battle where the Blue party consisting of one armed force $B$ is fighting against the Red party. The Red party consists of $n$ armed forces each of which is supplied by a supply unit. A new variable called “fire allocation” is associated to the Blue force, reflecting its strategy during the battle. A problem of optimal fire allocation for Blue force is then studied. The optimal fire allocation of the Blue force allows that the number of Blue troops is always at its maximum. It is sought in the form of a piece-wise constant function of time with the help of “threatening rates” computed for each agent of the Red party. Numerical experiments are included to justify the theoretical results.