Operational Research Notes > Lse Operational Research Notes > Operational Research Techniques Notes

Further Dynamic Programming Notes

This is a sample of our (approximately) 4 page long Further Dynamic Programming notes, which we sell as part of the Operational Research Techniques Notes collection, a 1st Class package written at LSE in 2011 that contains (approximately) 104 pages of notes across 17 different documents.

Learn more about our Operational Research Techniques Notes

Further Dynamic Programming Revision

The following is a plain text extract of the PDF sample above, taken from our Operational Research Techniques Notes. This text version has had its formatting removed so pay attention to its contents alone rather than its presentation. The version you download will have its original formatting intact and so will be much prettier to look at.

Lecture 14: Further Dynamic Programming Summary

• Distribution of Effort

• Stochastic dynamic programming

Distribution of effort

• At each stage we must clearly state the recursive equation

• At each stage the feasible values of x must be identified
○ This could affect the range of values to be investigated at each stage Example of a distribution of effort

Course Notes Page 33

****************************End Of Sample*****************************

Buy the full version of these notes or essay plans and more in our Operational Research Techniques Notes.