Research indexJournal article
Implementing the simplex method for the Optimization Subroutine Library
Forrest, Tomlin
IBM Systems Journal1 Jan 1992
NobleIDark:/48914/w1/20260523/D5A01FC4DOI10.1147/sj.311.0011
Implementing the simplex method for the Optimization Subroutine Library
Forrest, Tomlin · IBM Systems Journal · 1992 · Subscription
NobleIDark:/48914/w1/20260523/D5A01FC4DOI10.1147/sj.311.0011
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
In this paper 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™ vector architecture. For the later RISC System/6000™ 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.