×

zbMATH — the first resource for mathematics

Implementing the simplex method for the optimization subroutine library. (English) Zbl 0814.90075
Summary: We describe the simplex algorithm and briefly discuss the interaction of the detailed implementation of the algorithm with the changes in computer hardware over the last 30 years. Then we give one example of the design changes needed to implement the method efficiently for the IBM \(3090^{TM}\) vector architecture. For the later RISC SYSTEM/\(6000^{TM}\) implementation, it was necessary to rethink this yet again. Finally we discuss the issue of robustness and the steps that were taken to give maximum reliability in the simplex algorithm in the IBM Optimization Subroutine Library.

MSC:
90C05 Linear programming
65Y15 Packaged methods for numerical algorithms
65Y05 Parallel numerical computation
65K05 Numerical mathematical programming methods
Software:
OSL
PDF BibTeX XML Cite
Full Text: DOI