en
Report
English

Parallel Implementation of a Central Decomposition Method for Solving Large Scale Planning Problems

Collection
  • Cahiers de recherche; 1998.01
Publication date1998
Abstract

We use a decomposition approach to solve two types of realistic problems: Block-angular linear programs arising in energy planning, and multicommodity network problems arising in capacity planning for survivable telecommunication networks. Decomposition is an algorithmic device that down computations into several independent subproblems. It is thus ideally suited to parallel implementation. To achieve robustness and greater reliability in the performance of the decomposition algorithm, we use the Analytic Center Cutting Plane Method (ACCPM) to handle the master program. We run the algorithm on two different parallel computing platforms: a network of PC's running under Linux and a genuine parallel machine, the IBM SP2. The approach is well adapted for this coarse grain parallelism and the results display good speed-up's for the classes of problems we have treated

Citation (ISO format)
GONDZIO, Jacek, SARKISSIAN, Robert, VIAL, Jean-Philippe. Parallel Implementation of a Central Decomposition Method for Solving Large Scale Planning Problems. 1998
Identifiers
  • PID : unige:5907
452views
0downloads

Technical informations

Creation04/15/2010 12:21:09 PM
First validation04/15/2010 12:21:09 PM
Update time03/14/2023 3:27:00 PM
Status update03/14/2023 3:27:00 PM
Last indexation01/15/2024 7:45:54 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack