论文标题
在涉及供应单元的非线性Lanchester型模型中的优化
Optimization in a non-linear Lanchester-type model involving supply units
论文作者
论文摘要
在本文中，引入了涉及供应单元的非线性Lanchester型模型。该模型描述了一场战斗，其中由一个武装部队$ b $组成的蓝色政党正在与红党作战。红色党由$ n $武装部队组成，每个武装部队由供应单位提供。一个称为“火灾分配”的新变量与蓝色部队有关，反映了其在战斗中的策略。然后研究了蓝色力的最佳火灾分配问题。蓝色力量的最佳火灾分配使蓝色部队的数量始终处于最大状态。它是在针对红党的每个代理商计算的“威胁率”的帮助下以时间恒定函数的形式寻求的。包括数值实验以证明理论结果是合理的。
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.
