首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Complexity of stochastic dual dynamic programming
Authors:Lan  Guanghui
Institution:1.H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, 30332, USA
;
Abstract:Mathematical Programming - Stochastic dual dynamic programming is a cutting plane type algorithm for multi-stage stochastic optimization originated about 30 years ago. In spite of its popularity in...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号