English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this work, we introduce a nonlinear Lanchester model of NCW-type and studya problem of finding the optimal fire allocation for this model. A Blue party$B$ will fight against a Red party consisting of $A$ and $R$, where $A$ is anindependent force and $R$ fights with supports from a supply unit $N$. A battlemay consist of several stages but we consider the problem of finding optimalfire allocation for $B$ in the first stage only. Optimal fire allocation is aset of three non-negative numbers whose sum equals to one, such that theremaining force of $B$ is maximal at any instants. In order to tackle thisproblem, we introduce the notion of \textit{threatening rates} which arecomputed for $A, R, N$ at the beginning of the battle. Numerical illustrationsare presented to justify the theoretical findings.

Optimal fire allocation in a combat model of mixed NCW type