A Tutorial on Dynamic Programming

Michael A. Trick

Mini V, 1997

IMPORTANT:This material is provided since some find it useful. It represents course material from the 1990s. I no longer keep this material up to date. Please DO NOT EMAIL ME ON THIS MATERIAL. In particular, I regret that I have no time to clarify material or provide solutions to any of the questions or projects. I am tempted to just remove this material. Please don't abuse my decision to keep this online.

• Contents
• First Example
• A second example
• Common Characteristics
• The Knapsack Problem.
• An Alternative Formulation
• Equipment Replacement
• The Traveling Salesperson Problem
• Nonadditive Recursions
• Stochastic Dynamic Programming
  • Uncertain Payoffs
  • Uncertain States
  • ``Linear'' decision making
• About this document ...