Abstract
The weapon target assignment (WTA) problem that arises in defense related applications is to find a proper assignment of weapons to the enemy's targets with the objective of minimizing the total expected survival value of all targets. The WTA problem can be formulated as a nonlinear integer programming problem, and falls into the category of NP-Complete problems. This paper proposes an efficient approximation algorithm for this problem. The algorithm is to define new approximating subproblems on the original problem, which forms a feasible descent iteration scheme for finding a suboptimal solution. Numerical results demonstrate the effectiveness of the proposed algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
