Description: The method and algorithm for searching of the optimal plan of targets distribution from weapons which maximizes the value of the efficiency index when the system of constraints is implemented are proposed. The method and algorithm are based on the modification of the Hungarian optimization method with matrix formulation of assignment problems under the condition of a polynomial representation of the time function. The proposed method and algorithm allow to reduce the amount of computer memory and the number of operations in the implementation of calculations because it does not require the addition of an efficiency matrix to a square-form instead the Hungarian method. Examples of calculations using the proposed algorithm are given. The optimality of the obtained method and algorithm is confirmed by the method of equivalent transformations. The reliability of the method and algorithm is confirmed by the coincidence with the results obtained by the Hungarian method. The obtained results can be used in targeting algorithms between short range air defense systems. The presented results can also be used in the development of target distribution algorithms, which are implemented in real time processing, for interception ballistic targets (missiles, artillery shells, mines) and engaging of tactical unmanned aerial vehicles by air defense fire in to the air.
Keywords: air defence of The Army, optimal targets distrib ution, Hungarian optimization method