![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
We investigate the problem of finding the initial basic feasible solution in the simplex algorithm. Two modifications of the two-phase simplex method are presented. Implementations of the two-phase simplex method and its modifications in the programming package MATHEMATICA and the programming language Visual Basic are written. We report computational results on numerical examples from the Netlib test set.
2000 AMS Subject Classification :
Acknowledgements
We are grateful to Professor James Strayer for helpful conversations.