Application of Dynamic Programming in Planning Costs of Telecommunication Security Operations to Provide Aid to Civilian Authorities

Abstract

The problem in planning costs of an operation, i.e., the problem of determining an optimal capacity of units used in time is a highly complex problem whose solution can be obtained in different ways, depending on what is taken as an optimality criterion and the types of limiting factors that are present during an operation’s realization. The main goal of this paper is to show the practical application of dynamic programming with the aim of improving planning and organizing forces and costs during the realization of the Serbian army’s third mission. Data on the use of Serbian Military’s units after the earthquake in the area of Kraljevo in 2010 were analysed. The paper covers the use of dynamic programming, namely, the complex optimization problem of using military units, which depends on a large number of variables and can be extremely difficult to solve, is disassembled into several smaller partial problems that depend on one variable and are simpler to solve. The model of using the military is based on mission usage and represented as one of possible scenarios of natural disasters that engulfed a part of the Serbian territory.