Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming

Jr Jung Lyu, Hsing Luh, Ming Chang Lee

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

This paper employs the Dantzig-Wolfe decomposition principle to solve linear programming models in a parallel-computing environment. Adopting the queuing discipline, we showed that under very general conditions, the proposed algorithm speedup trends toward a limiting value as the number of processors increases.

Original languageEnglish
Pages (from-to)1431-1437
Number of pages7
JournalComputers and Mathematics with Applications
Volume44
Issue number10-11
DOIs
Publication statusPublished - 2002 Nov

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming'. Together they form a unique fingerprint.

Cite this