Algorithm to support decision-making regarding the placement of reserve units and logistical support of military formations in the area according to the minimax criterion

Abstract

The scientific issues of the article are aimed at the development of an algorithm for solving one of the important in practice of the class of problems of computational geometry - optimization. This task is related to the optimal placement of reserve units and logistical support of the military formation in the area according to the minimax criterion, which will be the basis for making a decision on the formation of a battle order and will ensure the minimization of the maximum response time to a change in the situation and the time of evacuation (carriage) in the conditions of increasing dynamic and spatial indicators of hostilities.
 The essence of the study is to choose a method of optimizing the function of the set of concentric circles based on its majorization by a paraboloid to solve the problem of placing a reserve unit and logistical support according to the minimax criterion and developing, based on it, an algorithm to support decision-making regarding the formation of the order of battle of a military formation in the area.
 Methods of optimization, computational geometry and algorithmization were used to solve the problem.
 The result of the work is a developed algorithm for finding the minimax point on the terrain in the area of hostilities relative to the units of the military formation and the defined boundaries.
 The implementation of the algorithm in the decision-making support system will ensure an increase in the efficiency and reasonableness of decision-making regarding the positioning of reserve units and logistical support in the overall construction of the order of battle of the military formation.