Dynamic programming for discrete optimization

Discrete optimization problems with particular structure can efficiently be solved using Dynamic Programming.

• Lecture 11 Deterministic dynp slides Shortest route slide
• Lecture 12, Probabilistic Dynamic Programming figure, explaining the recursive dependence.
• Lecture 12 Example from exam 20101218 question 1, system101218.pdf Download system101218.pdf
   solution: parkingsolution.pdf Download parkingsolution.pdf

The (second part of the) second home assignment applies Dynamic Programming to a Spare parts optimization problem.