The problem of planning the sending of messages in a cellular network to destinations with known needs is considered. It is assumed that the costs of transmitting information on the one hand are proportional to the transmitted volumes and the cost of transmitting a unit of information over the selected communication channels in cases of exceeding the traffic established by the contract with the mobile operator, and on the other hand are associated with a fixed subscription fee for the use of channels, independent of the volume of information transmitted. An indicator of the quality of the plan in this setting is the total cost of sending the entire planned volume of messages. A procedure for reducing the formulated problem to a linear transport problem is proposed. The accuracy of the solution obtained on the basis of the proposed algorithm is estimated.

Keywords: single jump function, transport problem, minimum total cost criterion, computational complexity of the algorithm, confidence interval

The task of planning the sending of messages of known volumes from source points to destinations with known needs. At the same time, it is assumed that the costs of transmitting information on the one hand are proportional to the transmitted volumes and the cost of transmitting a unit of information over the selected communication channels, and on the other hand are associated with a fixed subscription fee for the use of channels that does not depend on the volume of transmitted information. An indicator of the quality of the plan with such a statement is the total cost of sending the entire planned volume of messages. A comparative characteristic of the effectiveness of methods for obtaining optimal plans using a linearized objective function and an exact solution by one of the combinatorial methods is carried out.

Keywords: message transmission, transport task, criterion of minimum total costs, computational complexity of the algorithm, linearization of the objective function

The problem of data transformation in which calculations are carried out in parallel streams is considered. The goal is to draw up such a plan for the parallel assignment of data by performers, in which the conditions of validity, reliability, redundancy and adequacy of data suitable for further analysis will be satisfied. At the same time, taking into account the desire to complete data conversion cycles in the shortest possible time. The use of transport-type models is proposed for the solution. In contrast to two-dimensional minimax models by the criterion of time, the possibility of transformation of information is considered, both at source points and at destination points. The proposed model allows you to take into account the time of data delivery between processing sites. The influence of possible rules for moving information packets through intermediate points on the final value of the management quality indicator is shown.

Keywords: information chains, transport task, minimum time criterion, processing costs, data reliability

In contrast to the classical transport problem, according to the minimum total time criterion, it is assumed that resources are processed both at the source points and at the destination points, the duration of which depends linearly on the volume of the processed batch. This takes into account both the availability of the vehicles involved and their characteristics, such as load capacity. The use of the Hungarian method is justified for the distribution of resources along the available routes. To solve the problem of distribution of available vehicles by starting points, taking into account the load capacity of vehicles, it is proposed to use the method of dynamic programming. An illustrative example and distribution of delivery means using the "Search for a solution" command in MS Excel are considered.

Keywords: transport task, minimum time criterion, processing costs, load capacity

the formulated problem is a special case of the transportation problem with xed surcharges in which the value of the objective function affect only the time spent on the delivery of resources by the affected routes and do not affect the volumes of transported resources. A solution based on the linearization of the objective function is appropriate in cases of time constraints on finding a solution. Second, because of its relative simplicity, this solution can be used as a duplicate procedure (to determine the lower limit) to more complex, such as, combinatorial, algorithms for finding exact solution of the problem. Modification of the method of Balinsky is the sequential reduction of dimensionality of the original problem by eliminating rows or columns of the matrix of transportation in which the true costs match the costs of these tasks

Keywords: transportation problem, the minimum total time, linearization of the objective function, the method of Balinsky