Sequential Importance Sampling Algorithms for Dynamic Stochastic Programming

ISSN： 1072-3374

Source： Journal of Mathematical Sciences, Vol.133, Iss.4, 2006-03, pp. : 1422-1444

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Galerkin methods in dynamic stochastic programming

By Koivu Matti

Optimization, Vol. 59, Iss. 3, 2010-04 ,pp. : 339-354

Taylor & Francis Ltd

Access to resources Recommend Favorite

Dynamic Programming Algorithms for Generating Optimal Strip Layouts

By Cui Yaodong Huang Ling

Computational Optimization and Applications, Vol. 33, Iss. 2-3, 2006-03 ,pp. : 287-301

Springer Publishing Company

Access to resources Recommend Favorite

Dynamic programming in stochastic control of systems with delay

By Larssen Bjrnar

Stochastics and Stochastics Reports, Vol. 74, Iss. 3-4, 2002-01 ,pp. : 651-673

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the Convergence of Sampling-Based Decomposition Algorithms for Multistage Stochastic Programs

By Linowsky K. Philpott A.

Journal of Optimization Theory and Applications, Vol. 125, Iss. 2, 2005-05 ,pp. : 349-366

Springer Publishing Company

Access to resources Recommend Favorite

Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms

By Kulkarni Ankur

Computational Optimization and Applications, Vol. 51, Iss. 1, 2012-01 ,pp. : 77-123

Springer Publishing Company

Access to resources Recommend Favorite