Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Occasionally we use the superscript − T for the transpose of the inverse of a matrix. Hence, E −T = (E −1)T.
References
Dantzig, G., & Orchard-Hayes, W. (1954). The product form for the inverse in the simplex method. Mathematical Tables and Other Aids to Computation, 8, 64–67.
Duff, I., Erisman, A., & Reid, J. (1986). Direct methods for sparse matrices. Oxford: Oxford University Press.
Forrest, J., & Tomlin, J. (1972). Updating triangular factors of the basis to maintain sparsity in the product form simplex method. Mathematical Programming, 2, 263–278.
Gill, P., Murray, W., & Wright, M. (1991). Numerical linear algebra and optimization (Vol. 1). Redwood City: Addison-Wesley.
Goldfarb, D., & Reid, J. (1977). A practicable steepest-edge simplex algorithm. Mathematical Programming, 12, 361–371.
Golub, G., & VanLoan, C. (1989). Matrix computations (2nd ed.). Baltimore: The Johns Hopkins University Press.
Harris, P. (1973). Pivot selection methods of the Devex LP code. Mathematical Programming, 5, 1–28.
Markowitz, H. (1957). The elimination form of the inverse and its application to linear programming. Management Science, 3, 255–269.
Reid, J. (1982). A sparsity-exploiting variant of the Bartels-Golub decomposition for linear programming bases. Mathematical Programming, 24, 55–69.
Saunders, M. (1973). The complexity of LU updating in the simplex method. In R. Andersen, & R. Brent (Eds.), The complexity of computational problem solving (pp. 214–230). Brisbane: University of Queensland Press.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Vanderbei, R.J. (2020). Implementation Issues. In: Linear Programming. International Series in Operations Research & Management Science, vol 285. Springer, Cham. https://doi.org/10.1007/978-3-030-39415-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-39415-8_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-39414-1
Online ISBN: 978-3-030-39415-8
eBook Packages: Business and ManagementBusiness and Management (R0)