Abstract
<jats:p>With the proliferation of technology, the field of defense science and engineering is continuously advancing, and the accurate resolution of the Weapon Target Allocation Problem (WTAP) remains one of the primary concerns for any nation’s safety and security. WTAP involves the precise allocation of a set of weapon resources to potential targets in such a way that the damage inflicted on the opponent is maximized. WTAP is well known for its non-deterministic polynomial-time hard (NP-hard) nature.</jats:p> <jats:p>This work presents an in-depth study of the static WTAP, covering its characteristics, nature, formulation, performance issues, and potential research insights. The study contributes to a better understanding of key issues associated with WTAP, such as challenges in resource allocation, accurate assignment of resources, and precise mission planning and execution in dynamic defense environments.</jats:p>