Dynamic Programming and the Smoothing Problem

1 October 1956

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science

Vol. 3 (1) , 111-113
https://doi.org/10.1287/mnsc.3.1.111

Abstract

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.

Keywords

CONSTRAINTS
SMOOTHING PROBLEM
GEQQ
PROBLEM A PROBLEM
MINIMIZING
DYNAMIC PROGRAMMING
COMPUTATIONAL SOLUTION
FORM SUBJECT
TYPE X

This publication has 0 references indexed in Scilit: