GE330_lect18 - Lecture 18 Dynamic Programming Problems...

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

View Full Document Right Arrow Icon
Lecture 18 Dynamic Programming Problems April 13, 2009
Background image of page 1

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

View Full DocumentRight Arrow Icon
Dynamic Programming The material is in Chapter 10 1
Background image of page 2
Dynamic Programming Decompose a problem into several stages; Each stage comprise a much simpler problem, sometime called a subproblem; Require a recursive equation linking different stages; No general rule for the design a dynamic programming algo- rithm, it is very application-dependent; Takes a reasonable amount of practice before one is fully comfortable with it. 2
Background image of page 3

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

View Full DocumentRight Arrow Icon
Dynamic Programming: Shortest Path In the follow network, we want to find the shortest route from node 1 to node 7. We know algorithms for solving this problem, but now we want to use dynamic programming. We decompose the problem into stages as delineated by the vertical dashed lines in the figure on the next slide. 3
Background image of page 4
Dynamic Programming: Shortest Path The idea here is to compute the shortest distance from the start- ing node to all the terminal nodes of a stage and then use these distance as input data to the immediately succeeding stage. 4
Background image of page 5

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

View Full DocumentRight Arrow Icon
Dynamic Programming: Shortest Path Stage 1 Starting from node 1, stage 1 includes three end nodes (2, 3, and 4). It is easy to calculate: Shortest distance from node 1 to node 2 = 7(from node 1); Shortest distance from node 1 to node 3 = 8(from node 1); Shortest distance from node 1 to node 4 = 5(from node 1) . Stage 2
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 13

GE330_lect18 - Lecture 18 Dynamic Programming Problems...

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

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