英文版动态规划.pdfVIP

Chapter 2 Dynamic Programming (DP) 2.1 Concept Methods of DP 2.2 Applications of DP Chapter 2 Dynamic Programming (DP) 2.1 Concept Methods of DP Ⅰ .Example of DP Model (Multistage Programming) 1. Phase on Time (Allocations on work load of machines) Suppose a machine can work under either high-load and low- load. Under high load it can produce 8 per year and 70% are in good condition for the next year, while under low-load the relating number are 5 and 90%. If we have 1000 machines ,how do we allocate the amount of machines to work under high-load or low-load in order to maximize the production in 5 years. v v v v v 1 2 3 4 5 s s s s S =1000 2 3 4 5 1 1 2 3 4 5 x x x x x 1 2 3 4 5 Chapter 2 Dynamic Programming (DP) 2.Phase on Space （The Shortest-Path Problem ） As shown in the following figure, a person want to pave pipes from A to E. The numbers on the lines between every two points represent the distance. Now he has to find a “path” to pave the pipes in order to minimize the whole distance. 12 B1 C1 3 14 2 9 D 6 1 5 6 A 5 B2 10 C2 5 E 4 2 1