• English
    • español
  • English 
    • English
    • español
  • Login
View Item 
  •   Home
  • 2.- Investigación
  • Documentos de Trabajo
  • View Item
  •   Home
  • 2.- Investigación
  • Documentos de Trabajo
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Analysis of the performance of benders-based distributed decomposition methods for linear stochastic programming

Thumbnail
View/Open
IIT-12-016A.pdf (118.8Kb)
Author
Latorre Canteli, Jesús María
Palacios Hielscher, Rafael
Ramos Galán, Andrés
Estado
info:eu-repo/semantics/draft
Metadata
Show full item record
Mostrar METS del ítem
Ver registro en CKH

Refworks Export

Abstract
 
 
In stochastic programming, considering uncertainty might lead to large scale problems. Computational resources might fall short of the requirements for solving these problems, especially concerning memory capacity. Decomposition techniques help to clear this obstacle, by producing a set of smaller subproblems at the cost of additional computation time for coordination due to the iterative nature of the resolution algorithm. However, one way to mitigate the effect of the increased computational time derived from the decomposition is to solve the subproblems in parallel or distributed systems. This paper compares the performance of two different Benders decomposition techniques for linear stochastic problems when executed in two different computational grids (one using single-core computers and the other using dual-core computers). Decomposition methods that create less task-dependency can take advantage of computer resources available in the grid, thus compensating a small increase in the overall computational weight. In particular, the proposed method called "complete-scenario decomposition" requires a larger total CPU time (the sum of all individual CPU times in the grid) compared to traditional Benders decomposition; however, the computational overhead is compensated by a better grid performance, so the proposed method yields shorter execution times as measured by the user.
 
URI
http://hdl.handle.net/11531/14155
Analysis of the performance of benders-based distributed decomposition methods for linear stochastic programming
Palabras Clave

linear stochastic programming, distributed computing, Benders decomposition.
Collections
  • Documentos de Trabajo

Repositorio de la Universidad Pontificia Comillas copyright © 2015  Desarrollado con DSpace Software
Contact Us | Send Feedback
 

 

Búsqueda semántica (CKH Explorer)


Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsxmlui.ArtifactBrowser.Navigation.browse_advisorxmlui.ArtifactBrowser.Navigation.browse_typeThis CollectionBy Issue DateAuthorsTitlesSubjectsxmlui.ArtifactBrowser.Navigation.browse_advisorxmlui.ArtifactBrowser.Navigation.browse_type

My Account

LoginRegister

Repositorio de la Universidad Pontificia Comillas copyright © 2015  Desarrollado con DSpace Software
Contact Us | Send Feedback