A note on dynamic programming in accounts receivable management

The paper considers a dynamic programming formulation of the accounts receivable problem for single outstanding amounts. An optimal collection policy can be computed efficiently by invoking a “planning horizon” result that determines a time period beyond which the decision process cannot extend. The optimality of so called monotone policies is shown under rather intuitive restrictions on the collection probabilities.