For the development of village it is essential that agricultural farm makes the largest profit. Very important is to plan sowing in a optimal way, to obtain the biggest crop, which is easy to sell for a sharp price. It is difficult to take into consideration so many factors and constraints. The article presents discrete dynamic programming method which makes possible to find optimal solution of allotment problem with constraints using earlier captured experiences.
The paper presents a method baaed on dynamic programming permitting decision taking on the use and size of construction investment in private farms. It was limited to livestock buildings but the method can be also used for other types of investment, and even in different branches of the national economy. The algorithm of the procedure is based on the optimum plan for animal production based of own fodder resources, possibly enhanced with purchased fodder. The method permits effective modeling the size of the investment within the limits increasing the profitability of the farm and not leading to its bankruptcy. The optimization of animal production based on the recurrence dependence takes for the criteria the maximization of production in version I, the amount of hank credit without the loss of farm profitability in version II and maximization of the animal production using own fodder supplemented with purchases in version III. The establishment of an adequate date base and development of computer programs are the conditions for application of the here presented method.