Abstract
The basic Simplex algorithm for solving linear programming problems is re-examined. Computational steps which can be done in parallel are identified. Both parallel and vector speed are incorporated in the Simplex procedure. Special solution strategies are used to take further advantage of the cases where artificial and unrestricted (in sign) variables need to be introduced. Using FORCE (FORtran with Concurrent Extension) language, the developed parallel Simplex subroutine can be ported to seven different parallel and high performance computers. Small, medium and large scale numerical examples are used to demonstrate the effectiveness of the proposed Simplex method. Speed-up factors of upto 3.6 (using four Cray-2 processors) and 14.5 (using 15 Sequent processors) were obtained in this study.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
