Abstract
This chapter explores the nature of the solutions and their attendant difficulties in dynamic programming problems with a single-state variable and two or more decision variables at each stage. It explores problems for which there were more than one state variable and/or more than one decision variable at each stage that became intractable in terms of both the storage and computation that were required. The chapter discusses a nonlinear allocation problem with several decision variables and a stochastic decision problem. It describes a problem in product development and planning. It also presents an example of quadratic smoothing that has numerous applications in control theory and data analysis. It describes a problem in product development and planning.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call