from the conferences organized by TANGER Ltd.
One of the main problems companies have to solve is the distribution of resources among the potential beneficiaries. In many cases, this problem can be presented as a linear programming task with a linear objective function and constraining conditions. However, in some cases, the formulation of the problem as a mathematical programming task leads to integral or non-linear models requiring difficult or costly solution procedures. Dynamic programming offers a better way of dealing with these complex examples. The aim of the article is to show a suitable utilization of dynamic programming using an example of an allocation task.
Keywords: dynamic programming, optimization, allocation problem© This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.