Advanced Search
MyIDEAS: Login to save this paper or follow this series

Parallelization and Aggregation of Nested Benders Decomposition

Contents:

Author Info

  • M.A.H. Dempster
  • R.T. Thompson
Registered author(s):

    Abstract

    Dynamic multistage stochastic linear programming has many practical applications for problems whose current decisions have to be made under future uncertainty. There are a variety of methods for solving these problems, including nested Benders decomposition. In this method, recently shown to be superior to the alternatives for large problems, the problem is decomposed into a set of smaller linear programming problems. These problems can be visualised as being attached to the nodes of a tree which is formed from the realizations of the random data vectors determining the uncertainty in the problem. The tree is traversed forwards and backwards, with information from the solutions to each nodal linear programming problem being passed to its immediate descendants by the formation of their right hand sides and to its immediate ancestor in the form of cuts. Problems in the same time period can be solved independently and it is this inherent parallelism that is exploited in our parallel nested Benders algorithm. A parallel version of the MSLiP nested Benders code has been developed and tested on various types of MIMD machines. The differing structures of the test problems cause differing levels of speed-up. Results show that problems with few variables and constraints per node do not gain from this parallelization. Stage aggregation has been successfully explored for such problems to improve their parallel solution efficiency by increasing the size of the nodes and therefore the time spent calculating relative to the time spent communicating between processors.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: ftp://mibm2.jims.cam.ac.uk/pub/PAPERS/01_95.ps.gz
    Our checks indicate that this address may not be valid because: 500 Failed to connect to FTP server mibm2.jims.cam.ac.uk: Net::FTP: Bad hostname 'mibm2.jims.cam.ac.uk'. If this is indeed the case, please notify (WoPEc Project)
    Download Restriction: no

    Bibliographic Info

    Paper provided by University of Cambridge, The Judge Institute in its series Finance Research Papers with number 01/95.

    as in new window
    Length:
    Date of creation:
    Date of revision:
    Handle: RePEc:wuk:cajirp:0195

    Contact details of provider:
    Postal: Trumpington Street, Cambridge, CB2 1AG
    Phone: +44 (0) 1223 339 700
    Fax: +44 (0) 1223 339 701
    Email:
    Web page: http://www.jbs.cam.ac.uk/
    More information through EDIRC

    Related research

    Keywords: Linear programming; dynamic stochastic programming; nested Benders decomposition; parallel algorithms; aggregation; MIMD computers;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:wuk:cajirp:0195. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (WoPEc Project).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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