Multi-Platform Air Defence Scheduling Based on 0-1 Integer Linear Programming

In order to solve the nonlinear combinational optimization problem of weapons resources dynamic combination and target matching on different platforms stably and efficiently. Using the discrete time dynamic model of cooperative air defense, based on equivalent approximation of linear inequality combination to nonlinearity equation under the 0-1 integer linear feature, this paper establish a 0-1 integer linear programming model for the cooperative air defense scheduling, which provide a feasible theory scheme for the solution of global optimization scheme in the dynamic environment.