Dynamic Programming and the Smoothing Problem

Richard Bellman

Management Science, 1956, vol. 3, issue 1, 111-113

Abstract: 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 \geqq 0, . A computational solution of this problem is given, using the methods of dynamic programming.

Date: 1956
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.3.1.111 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:3:y:1956:i:1:p:111-113

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().