EN
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.