ONE WAY OF SOLVING DYNAMIC PROGRAMMING PROBLEMS

Silvestru MAXIMILIAN, Sergiu CATARANCIUC, Gheorghe CĂPĂȚÂNĂ, Emil CATARANCIUC Universitatea de Stat din Moldova

Аннотация

In this paper, we propose an efficient method for practical use, for solving dynamic programming problems. Solving process is divided into steps and is a very simple calculation scheme for the users. The proposed method is described by examining the problem of optimal investment between branches. The calculations are presented in tables. Keywords: dynamic programming, input-output model, maximum benefit function, sequential optimization, resource allocation.