Skip to main content

Numerical Algorithms

  • Chapter
  • First Online:
Book cover Stochastic Multi-Stage Optimization

Part of the book series: Probability Theory and Stochastic Modelling ((PTSM,volume 75))

  • 1947 Accesses

Abstract

In this chapter, we consider the issue of numerical approximation of the solution of stochastic optimal control (SOC) problems for which optimality conditions were studied in Chap. 5.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    “Binary” means that each node is followed by two sons, or, otherwise stated, the branching rate is equal to 2.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pierre Carpentier .

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Carpentier, P., Chancelier, JP., Cohen, G., De Lara, M. (2015). Numerical Algorithms. In: Stochastic Multi-Stage Optimization. Probability Theory and Stochastic Modelling, vol 75. Springer, Cham. https://doi.org/10.1007/978-3-319-18138-7_7

Download citation

Publish with us

Policies and ethics