  In this paper, we analyze dynamic programming as a novel approach to solve
the problem of maximizing the profits of a bank. The mathematical model of the
problem and the description of a bank's work is described in this paper. The
problem is then approached using the method of dynamic programming. Dynamic
programming makes sure that the solutions obtained are globally optimal and
numerically stable. The optimization process is set up as a discrete
multi-stage decision process and solved with the help of dynamic programming.
