Skip navigation
Please use this identifier to cite or link to this item:
Title: Maximisation of expected target damage value
Authors: Deep, K.
Pant M.
Published in: Defence Science Journal
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.
Citation: Defence Science Journal (2005), 55(2): 133-139
Issue Date: 2005
Publisher: Defense Scientific Information and Documentation Centre
Keywords: Genetic algorithm
I-GRST algorithm
Integer programming problems
Target damage
Weapon assignment
ISSN: 0011748X
Author Scopus IDs: 8561208900
Author Affiliations: Deep, K., Indian Institute of Technology, Roorkee-241 667, India, Dept. of Mathematics, Indian Institute of Technology. (IIT), Roorkee, India
Pant, M., Indian Institute of Technology, Roorkee-241 667, India
Corresponding Author: Deep, K.; Indian Institute of Technology, Roorkee-241 667, India
Appears in Collections:Journal Publications [MA]

Files in This Item:
There are no files associated with this item.
Show full item record

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.