Weapon target assignment problem: Difference between revisions

Revision as of 17:46, 18 July 2011

Revision as of 02:28, 19 July 2011

Line 15:

The '''weapon target assignment problem''' is often formulated as the following nonlinear [[integer programming]] problem:

:<math>\min \sum_{j = 1}^{n} \left ( V_{j}\prod_{i = 1}^{m} q_{ij}^{x_{ij}} \right )</math>

subject to the constraints

:<math>\sum_{j = 1}^{n} x_{ij}\leq W_{i}W_i \text{ for }i = 1, \ldots, m, \, </math>

:<math>x_{ij}\ge 0\text{ and integer for }i = 1, \ldots, m \text{ and }j = 1, \ldots, n.</math>