Journal article // Social Development and Security






Iterative Method of Dynamic Efficiency in A Multidimensional Linear Programming Problem to Increase the Efficiency of Resource Support
2021  //  DOI: 10.33445/sds.2021.11.5.3
Anatoly Nevolnichenko, Ruslan Boiko, Anatolii Loishyn

Metrics

  • Eye Icon 0 views
  • Download Icon 0 downloads
Metrics Icon 0 views  //  0 downloads
Abstract

A typical problem of optimal resource allocation is known in operations research as a linear programming problem with a multidimensional argument, which arises when making decisions to control a “complex ergatic combat system (CS)” during its creation (“tender” problem) and application (“transport” problem). The “tender” task is to find the optimal plan for orders and supplies of heterogeneous resources to create elements (objects) of the CS structure, which maximizes the efficiency of using budget funds (expenses). The “transport” task is to find the optimal plan for orders and supplies of dissimilar consumable resources to restore the combat capability of the elements (objects) of the CS structure, which increases the efficiency of using the costs of resource support. If in the tender task the costs take into account the cost of resources and the cost of their delivery, then in the transport task the costs are only “transport” (for delivery).
The proposed methodological approach is based on a universal formulation of problems of this class and a universal iterative method of “dynamic efficiency” of their solution, which is the development of methods of the theory of optimal solutions in military cybernetics. The main practical value of the proposed approach lies in the fact that it will allow solving this class of problems with an imbalance in the supply of resources.

Full text
Show more arrow
 

Metrics

  • Eye Icon 0 views
  • Download Icon 0 downloads
Metrics Icon 0 views  //  0 downloads