IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v124y2003i1p133-16310.1023-banor.0000004766.05076.9d.html
   My bibliography  Save this article

Solving Sequences of Refined Multistage Stochastic Linear Programs

Author

Listed:
  • Karl Frauendorfer
  • Gido Haarbrücker

Abstract

Multistage stochastic programs with continuous underlying distributions involve the obstacle of high-dimensional integrals where the integrands' values again are given by solutions of stochastic programs. A common solution technique consists of discretizing the support of the original distributions leading to scenario trees and corresponding LPs which are – up to a certain size – easy to solve. In order to improve the accuracy of approximation, successive refinements of the support result in rapidly expanding scenario trees and associated LPs. Hence, the solvability of the multistage stochastic program is limited by the numerical solvability of sequences of such expanding LPs. This work describes an algorithmic technique for solving the large-scale LP of refinement ν based on the solutions at the previous ν−1 refinements. Numerical results are presented for practical problem statements within financial applications demonstrating significant speedup (depending on the size of the LP instances). Copyright Kluwer Academic Publishers 2003

Suggested Citation

  • Karl Frauendorfer & Gido Haarbrücker, 2003. "Solving Sequences of Refined Multistage Stochastic Linear Programs," Annals of Operations Research, Springer, vol. 124(1), pages 133-163, November.
    • Handle: RePEc:spr:annopr:v:124:y:2003:i:1:p:133-163:10.1023/b:anor.0000004766.05076.9d
    DOI: 10.1023/B:ANOR.0000004766.05076.9d
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/B:ANOR.0000004766.05076.9d
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/B:ANOR.0000004766.05076.9d?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:124:y:2003:i:1:p:133-163:10.1023/b:anor.0000004766.05076.9d. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.