In: Advanced Math
Consider the missile allocation problem (MAP) with discretized time. (a) For MAP, an extreme case may be to maximize the probability of shooting down only those ASMs targeting the high value ships, ignoring the rest. How can you modify MAP model to accomplish that situation? (b) The probability of no leaker may be a very small figure, when there is a large number of attacking ASMs. For such cases, modify the objective function for maximizing the expected number of ASMs shot down.
solution:
Missile Allocation Problem (MAP):-
# Basically, Missile Allocation Problem (MAP) refers to the optimal allocation of a given surface-to-air missiles (SAMs) of a specific naval task group to a set of attacking air targets.
# MAP is an emerging treatment of a growing problem brought by rapid increase in the anti-ship missile (ASM) capabilities (Karasakal, Özdemirel & Kandiller, 2013).
# This enables a collective and fully coordinated defense against the targets. Ideally, to maximize the probability of shooting down only those ASMs targeting high value ships, one can modify the MAP model by grouping together all naval combatants and auxiliaries together for the achievement of a common objective.
#This ensures that all the combatants work towards a common objective and achieve a greater reinforcement. Also, the MAP systems should be modified and integrated with new technologies such as tactical data links and cooperative engagement to increase the accuracy of identifying and shooting the target ships.
# Integrating the MAP capabilities with the modern area air deference missile systems can also help to provide the needed capabilities to deal with the target.