Dynamic Programming and the Smoothing Problem

A problem in the study of production smoothing leads to the problem of minimizing a linear form subject to constraints of the type x_i ≧ 0, . A computational solution of this problem is given, using the methods of dynamic programming.