COMPUTING EXPERIENCE WITH LINEAR PROGRAMMING AND ITS VARIANTS
RAND CORP SANTA MONICA CA
Pagination or Media Count:
The application of linear programming to complex problems gives rise to the handling of large matrix problems. The simplex method proved to be the most expedient of any tried but, since this is essentially Gaussian elimination, numerical techniques for handling it have definite limitations, both with regard to running time and memory size. RANDs simplex codes for the IBM 701 were designed, through revisions to the method and special compiling routines, to maintain great precision and facilitate checking, to be adaptable to many variations, and to be as automatic in operation as possible. Several quite large models of considerable variety are discussed along with the prospects for future improvements, both in theory and in coding techniques.
- Operations Research
- Computer Programming and Software