dual dynamic programing with cut selection convergence proof and numerical experiments:(双重动态编程与减少选择收敛性证明和数值实验).pdfVIP

dual dynamic programing with cut selection convergence proof and numerical experiments:(双重动态编程与减少选择收敛性证明和数值实验).pdf

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
dual dynamic programing with cut selection convergence proof and numerical experiments:(双重动态编程与减少选择收敛性证明和数值实验)

European Journal of Operational Research 258 (2017) 47–57 Contents lists available at ScienceDirect European Journal of Operational Research journal homepage: /locate/ejor Continuous Optimization Dual Dynamic Programing with cut selection: Convergence proof and numerical experiments Vincent Guigues∗ Fundação Getulio Vargas, School of Applied Mathematics, 190 Praia de Botafogo, Rio de Janeiro 22250-900, Brazil a r t i c l e i n f o a b s t r a c t Article history: We consider convex optimization problems formulated using dynamic programing equations. Such prob- Received 25 February 2015 lems can be solved using the Dual Dynamic Programing algorithm combined with the Level 1 cut selec- Accepted 25 October 2016 tion strategy or the Territory algorithm to select the most relevant Benders cuts. We propose a limited Available online 3 November 2016 memory variant of Level 1 and show the convergence of DDP combined with the Territory algorithm, Keywords: Level 1 or its variant for nonlinear optimization problems. In the special case of linear programs, we Dynamic Programing show convergence in a finite number of iterations. Numerical simulations illustrate the interest of our Nonlinear programing variant and show that it can be much quicker than a simplex algorithm on some large instances of port- Dec

您可能关注的文档

文档评论(0)

18273502 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档