| Article ID: | iaor20052333 |
| Country: | Netherlands |
| Volume: | 25 |
| Issue: | 4 |
| Start Page Number: | 149 |
| End Page Number: | 157 |
| Publication Date: | Nov 1999 |
| Journal: | Operations Research Letters |
| Authors: | Johnson Ellis L., Hu Jing |
| Keywords: | Simplex method |
The two main ideas implemented are a primal–dual subproblem simplex method and a compact matrix storage scheme to speed up linear programming solution times. Two classes of problems are solved: crew-pairing optimization and cutting stock. The matrix storage schemes are different for these two problem classes, and the one for cutting stock is a hybrid using dynamic programming ideas.