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.
- Saunders, M. (1973), The complexity of LU updating in the simplex method, in R. Andersen & R. Brent, eds, ‘The complexity of computational problem solving’, University Press, Queensland, pp. 214–230.Google Scholar