Dynamic programming for spatial allocation of advertising expenditure

The paper deals with optimal allocation of a given amount of advertising expenditure among various sales districts. It applies dynamic programming to arrive at the optimal policy regarding such allocation. The basic model is that of Zentler and Ryde which heretofore has been solved using a graphical method. The optimal solution is illustrated with an example.