英文版动态规划.pdf

下载文档 降价啦

62
0
约3.39万字
约 37页
2017-05-06 发布于浙江
举报
版权申诉
保障服务

英文版动态规划.pdf

1、本文档共37页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

英文版动态规划

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