IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v99y2000i1p167-18710.1023-a1019245101545.html
   My bibliography  Save this article

Building and Solving Large-Scale Stochastic Programs on an Affordable Distributed Computing System

Author

Listed:
  • Emmanuel Fragnière
  • Jacek Gondzio
  • Jean-Philippe Vial

Abstract

We present an integrated procedure to build and solve big stochastic programming models. The individual components of the system – the modeling language, the solver and the hardware – are easily accessible, or a least affordable to a large audience. The procedure is applied to a simple financial model, which can be expanded to arbitrarily large sizes by enlarging the number of scenarios. We generated a model with one million scenarios, whose deterministic equivalent linear program has 1,111,112 constraints and 2,555,556 variables. We have been able to solve it on the cluster of ten PCs in less than 3 hours. Copyright Kluwer Academic Publishers 2000

Suggested Citation

  • Emmanuel Fragnière & Jacek Gondzio & Jean-Philippe Vial, 2000. "Building and Solving Large-Scale Stochastic Programs on an Affordable Distributed Computing System," Annals of Operations Research, Springer, vol. 99(1), pages 167-187, December.
    • Handle: RePEc:spr:annopr:v:99:y:2000:i:1:p:167-187:10.1023/a:1019245101545
    DOI: 10.1023/A:1019245101545
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1019245101545
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1019245101545?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jacek Gondzio & Roy Kouwenberg, 2001. "High-Performance Computing for Asset-Liability Management," Operations Research, INFORMS, vol. 49(6), pages 879-891, December.
    2. Babak Saleck Pay & Yongjia Song, 2020. "Partition-based decomposition algorithms for two-stage Stochastic integer programs with continuous recourse," Annals of Operations Research, Springer, vol. 284(2), pages 583-604, January.
    3. Yan Deng & Shabbir Ahmed & Siqian Shen, 2018. "Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs," INFORMS Journal on Computing, INFORMS, vol. 30(1), pages 90-105, February.
    4. C A Poojari & C Lucas & G Mitra, 2008. "Robust solutions and risk measures for a supply chain planning problem under uncertainty," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 2-12, January.
    5. Fengqi You & Ignacio Grossmann, 2013. "Multicut Benders decomposition algorithm for process supply chain planning under uncertainty," Annals of Operations Research, Springer, vol. 210(1), pages 191-211, November.
    6. Emilia Grass & Kathrin Fischer & Antonia Rams, 2020. "An accelerated L-shaped method for solving two-stage stochastic programs in disaster management," Annals of Operations Research, Springer, vol. 284(2), pages 557-582, January.

    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:99:y:2000:i:1:p:167-187:10.1023/a:1019245101545. 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.