Abstract:
The paper studies the possibilities of optimizing stochastic dicrete systems with finite state spaces through one well-known iterative procedure of stochastic approximation. The resultant solution procedures in certain cases require a smaller computer load than dynamic programming does.