Documentation of decomp: A dantzig-wolfe decomposition code for linear programming
Date Issued
June 1, 1988
Author(s)
Sundarraj, Rangaraja P.
Advisor(s)
J. K. Ho
Additional Advisor(s)
Kenneth C. Gilbert
Charles P. Pfleeger
Abstract
This thesis is a documentation of DECOMP, an implementation of the Dantzig-Wolfe decomposition algorithm for solving block angular linear programming problems based on the scheme of Ho and Loute (1981).
We first present the specifications that must be met by any robust implementation of linear programming decomposition. A detailed explanation of the sub-routines of an IBM/370 version of DECOMP then follows with an objective to aid research on computational aspects of large scale linear programming.
Degree
Master of Science
Major
Management Science
File(s)![Thumbnail Image]()
Name
Thesis88S883.pdf
Size
12.34 MB
Format
Unknown
Checksum (MD5)
cb4b3c8fe83f6fe4517c07888caddf6c