Skip to main content
SpringerLink
Log in

The problem of controlling resources on network graphs as an optimal control problem

  • Published:
Moscow University Computational Mathematics and Cybernetics Aims and scope Submit manuscript

Abstract

The problem of optimal distribution of resources dedicated to a certain complex of inter-related tasks according to the criterion of minimum execution time of all tasks is described. A reenterable (reusable) resource is considered instead of a traditional separable-type resource supposing a fixed distribution among tasks. The problem is formalized in direct static and dynamic settings. The latter is a classical performance optimal control problem. The correctness of the formalization is substantiated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. G. Davydov, Games, Graphs, Resources (Radio i Svyaz’, Moscow, 1981) [in Russian].

    MATH  Google Scholar 

  2. V. M. Alekseev, V. M. Tikhomirov, and S. V. Fomin, Optimal Control (Nauka, Moscow, 1979) [in Russian].

    Google Scholar 

  3. L. S. Pontryagin, V. G. Boltyanskii, R. V. Gamkrelidze, and E. F. Mishchenko, The Mathematical Theory of Optimal Processes (Nauka, Moscow, 1976; Gordon and Breach, New York, 1986).

    Google Scholar 

  4. N. N. Moiseev, Numerical Methods in the Theory of Optimal Systems (Nauka, Moscow, 1971).

    Google Scholar 

  5. F. P. Vasil’ev, Optimization Methods (Faktorial, Moscow, 2002) [in Russian].

    Google Scholar 

  6. B. M. Budak and F. P. Vasil’ev, Some Computational Aspects of Optimal Control Problems (Mosk. Gos. Univ., Moscow, 1975) [in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. All-Russia Research Institute for Problems of Civil Defense and Emergency Situations, Ministry of the Russian Federation for Civil Defense, Emergencies, and Elimination of Consequences of Natural Disasters, Davydkovskaya ul. 7, Moscow, Russia

    O. A. Kosorukov

  2. Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119991, Russia

    A. G. Belov

Authors
  1. O. A. Kosorukov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. G. Belov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to O. A. Kosorukov.

Additional information

Original Russian Text © O.A. Kosorukov, A.G. Belov, 2014, published in Vestnik Moskovskogo Universiteta. Vychislitel’naya Matematika i Kibernetika, 2014, No. 2, pp. 29–33.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kosorukov, O.A., Belov, A.G. The problem of controlling resources on network graphs as an optimal control problem. MoscowUniv.Comput.Math.Cybern. 38, 59–63 (2014). https://doi.org/10.3103/S0278641914020058

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0278641914020058

Keywords

Search

Navigation