In the previous chapter, we rewrote the simplex method using matrix notation. This is the first step toward our aim of describing the simplex method as one would implement it as a computer program. In this chapter, we shall continue in this direction by addressing some important implementation issues.
KeywordsSimplex Method Implementation Issue Gaussian Elimination Basis Matrix Permutation Matrix
Unable to display preview. Download preview PDF.
- Markowitz, H. (1957), ‘The elimination form of the inverse and its application to linear programming’, Management Science 3, 255–269. 150Google Scholar
- Dantzig, G., and Orchard-Hayes, W. (1954), ‘The product form for the inverse in the simplex method’, Mathematical Tables and Other Aids to Computation 8, 64–67. 150Google Scholar
- Forrest, J., and Tomlin, J. (1972), ‘Updating triangular factors of the basis to maintain sparsity in the product form simplex method’, Mathematical Programming 2, 263–278. 150Google Scholar
- Saunders, M. (1973), The complexity of LU updating in the simplex method, in R. Andersen, and R. Brent, eds, ‘The complexity of computational problem solving’, University Press, Queensland, pp. 214–230. 150Google Scholar
- Goldfarb, D., and Reid, J. (1977), ‘A practicable steepest-edge simplex algorithm’, Mathematical Programming 12, 361–371. 150Google Scholar
- Harris, P. (1973), ‘Pivot selection methods of the Devex LP code’, Mathematical Programming 5, 1–28. 150Google Scholar