摘要: A new decomposition method for multistage stochastic linear programming problems is proposed. problem represented in a tree-like form and with each node of the decision tree certain or quadratic subproblem associated. The subproblems generate proposals their successors some backward information predecessors. can be solved parallel exchange an asynchronous way through special buffers. After finite time either finds optimal solution to discovers its inconsistency. An analytical illustrative example shows that parallelization speed up computation over every sequential method. Computational experiments indicate large we obtain substantial gains efficiency moderate numbers processors.