Dynamic Programming and the Smoothing Problem

A problem in the study of production smoothing leads to the problem of minimizing a linear form [Formula: see text] subject to constraints of the type x i ≧ 0, [Formula: see text]. A computational solution of this problem is given, using the methods of dynamic programming.

• 저널Management Science · 3(1) · 111–113
• 토픽Optimization and Mathematical Programming · Control and Systems Engineering
• DOI10.1287/mnsc.3.1.111
• 저자Richard Bellman