Parallel algorithms to solve two-stage stochastic linear programs with robustness constraints

P. Beraldi, L. Grandinetti, R. Musmanno, C. Triki

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

In this paper we present a parallel method for solving two-stage stochastic linear programs with restricted recourse. The mathematical model considered here can be used to represent several real-world applications, including financial and production planning problems, for which significant changes in the recourse solutions should be avoided because of their difficulty to be implemented. Our parallel method is based on a primal-dual path-following interior point algorithm, and exploits fruitfully the dual block-angular structure of the constraint matrix and the special block structure of the matrices involved in the restricted recourse model. We describe and discuss both message-passing and shared-memory implementations and we present the numerical results collected on the Origin2000.

Original languageEnglish
Pages (from-to)1889-1908
Number of pages20
JournalParallel Computing
Volume26
Issue number13-14
DOIs
Publication statusPublished - Dec 2000

Fingerprint

Parallel Methods
Linear Program
Parallel algorithms
Parallel Algorithms
Robustness
Path-following Algorithm
Block Structure
Interior-point Algorithm
Production Planning
Primal-dual
Message passing
Message Passing
Shared Memory
Real-world Applications
Mathematical Model
Mathematical models
Data storage equipment
Planning
Numerical Results
Model

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

Parallel algorithms to solve two-stage stochastic linear programs with robustness constraints. / Beraldi, P.; Grandinetti, L.; Musmanno, R.; Triki, C.

In: Parallel Computing, Vol. 26, No. 13-14, 12.2000, p. 1889-1908.

Research output: Contribution to journalArticle

Beraldi, P. ; Grandinetti, L. ; Musmanno, R. ; Triki, C. / Parallel algorithms to solve two-stage stochastic linear programs with robustness constraints. In: Parallel Computing. 2000 ; Vol. 26, No. 13-14. pp. 1889-1908.
@article{e163d740b83e4ec391e86eb36f194240,
title = "Parallel algorithms to solve two-stage stochastic linear programs with robustness constraints",
abstract = "In this paper we present a parallel method for solving two-stage stochastic linear programs with restricted recourse. The mathematical model considered here can be used to represent several real-world applications, including financial and production planning problems, for which significant changes in the recourse solutions should be avoided because of their difficulty to be implemented. Our parallel method is based on a primal-dual path-following interior point algorithm, and exploits fruitfully the dual block-angular structure of the constraint matrix and the special block structure of the matrices involved in the restricted recourse model. We describe and discuss both message-passing and shared-memory implementations and we present the numerical results collected on the Origin2000.",
author = "P. Beraldi and L. Grandinetti and R. Musmanno and C. Triki",
year = "2000",
month = "12",
doi = "10.1016/S0167-8191(00)00057-0",
language = "English",
volume = "26",
pages = "1889--1908",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "13-14",

}

TY - JOUR

T1 - Parallel algorithms to solve two-stage stochastic linear programs with robustness constraints

AU - Beraldi, P.

AU - Grandinetti, L.

AU - Musmanno, R.

AU - Triki, C.

PY - 2000/12

Y1 - 2000/12

N2 - In this paper we present a parallel method for solving two-stage stochastic linear programs with restricted recourse. The mathematical model considered here can be used to represent several real-world applications, including financial and production planning problems, for which significant changes in the recourse solutions should be avoided because of their difficulty to be implemented. Our parallel method is based on a primal-dual path-following interior point algorithm, and exploits fruitfully the dual block-angular structure of the constraint matrix and the special block structure of the matrices involved in the restricted recourse model. We describe and discuss both message-passing and shared-memory implementations and we present the numerical results collected on the Origin2000.

AB - In this paper we present a parallel method for solving two-stage stochastic linear programs with restricted recourse. The mathematical model considered here can be used to represent several real-world applications, including financial and production planning problems, for which significant changes in the recourse solutions should be avoided because of their difficulty to be implemented. Our parallel method is based on a primal-dual path-following interior point algorithm, and exploits fruitfully the dual block-angular structure of the constraint matrix and the special block structure of the matrices involved in the restricted recourse model. We describe and discuss both message-passing and shared-memory implementations and we present the numerical results collected on the Origin2000.

UR - http://www.scopus.com/inward/record.url?scp=0034501719&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034501719&partnerID=8YFLogxK

U2 - 10.1016/S0167-8191(00)00057-0

DO - 10.1016/S0167-8191(00)00057-0

M3 - Article

VL - 26

SP - 1889

EP - 1908

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 13-14

ER -