Maximisation of expected target damage value

Abstract

The weapon assignment problem has been modelled as a nonlinear integer programming problem1, The problem is to assign weapons to the targets to maximise the optimum-target damage value. There are constraints on various types of weapons available and on minimum number of weapons by types to be assigned to various targets. The objective function is nonlinear, the constraints are linear in nature, and the decision variables are restricted to be integers, The results obtained by Bracken and McCormick1 should not be applied to solve the problem of weapon assignment to target to maximise the optimum target damage value, because firstly, the results violate the constraints, and secondly, instead of using the integer programming techniques, the crude method of rounding off has been used to obtain the solution. In this study, the I-GRST algorithm developed by Deep and Pant2,3 has been used to solve the weapon assignment problem. The results obtained are better than the results obtained by Bracken and McCormick1 and also do not violate any constraints. © 2005, DESIDOC.