lec9 - Dynamic Programming ! ! ! ! A general approach to...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Dynamic Programming ! A general approach to problem-solving ! In most cases: work backwards from the end ! Particular equations must be tailored to each situation ! To develop insight, expose to wide variety of DP problems Characteristics of DP Problems ! Stages, decision at each stage ! Each stage has assoc states ! Decision describes transition to next stage ! Given current stage, subsequent decisions must not depend on previously chosen decisions or states. ! Recursion relates cost/reward: f t (i) = min {c ij + f t+1 (j)} j
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Example: Stagecoach Problem A fortune-seeker in Missouri decides to go west to join the 49’er gold rush in California. The journey requires traveling by stagecoach through unsettled country, with serious danger of attack by marauders. The starting point and destination are fixed, all possible routes with life-insurance costs are shown on next page. Stagecoach Problem cont … 1 2 3 4 5 6 7 10 8 9 2 5 1 10 12 5 10 7 15 13 7 5 3 7 7 1 1 4 Which route minimizes total cost?
Background image of page 2
Optimized Investments !
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/05/2008 for the course IE 221 taught by Professor Georgewilson during the Spring '08 term at Lehigh University .

Page1 / 9

lec9 - Dynamic Programming ! ! ! ! A general approach to...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online