Affiliation:
1. National Aeronautics and Space Administration, Moffett Field, CA
Abstract
Dantzig--Wolfe Decomposition is recognized as a powerful, algorithmic tool for solving linear programs of block-angular form. While use of the approach has been reported in a wide variety of domains, there has not been a general implementation of Dantzig--Wolfe decomposition available. This article describes an open-source implementation of the algorithm. It is general in the sense that any properly decomposed linear program can be provided to the software for solving. While the original description of the algorithm was motivated by its reduced memory usage, modern computers can also take advantage of the algorithm's inherent parallelism. This implementation is parallel and built upon the POSIX threads (pthreads) library. Some computational results are provided to motivate use of such parallel solvers, as this implementation outperforms state-of-the-art commercial solvers in terms of wall-clock runtime by an order of magnitude or more on several problem instances.
Publisher
Association for Computing Machinery (ACM)
Subject
Applied Mathematics,Software
Reference23 articles.
1. Branch-and-Price: Column Generation for Solving Huge Integer Programs
2. Bertsimas D. and Tsitsiklis J. N. 1997. Introduction to Linear Optimization. Athena Scientific Belmont MA. Bertsimas D. and Tsitsiklis J. N. 1997. Introduction to Linear Optimization. Athena Scientific Belmont MA.
3. Decomposing Matrices into Blocks
4. Decomposition Principle for Linear Programs
5. Crew pairing at Air France
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献