TY - CHAP
T1 - Efficiency of the simplex method
AU - Vanderbei, Robert J.
N1 - Publisher Copyright:
© The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2020.
PY - 2020
Y1 - 2020
N2 - In the previous chapter, we saw that the simplex method (with appropriate pivoting rules to guarantee no cycling) will solve any linear programming problem for which an optimal solution exists. In this chapter, we investigate just how fast it will solve a problem of a given size.
AB - In the previous chapter, we saw that the simplex method (with appropriate pivoting rules to guarantee no cycling) will solve any linear programming problem for which an optimal solution exists. In this chapter, we investigate just how fast it will solve a problem of a given size.
UR - http://www.scopus.com/inward/record.url?scp=85089999513&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85089999513&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-39415-8_4
DO - 10.1007/978-3-030-39415-8_4
M3 - Chapter
AN - SCOPUS:85089999513
T3 - International Series in Operations Research and Management Science
SP - 43
EP - 58
BT - International Series in Operations Research and Management Science
PB - Springer
ER -