Affiliation:
1. Tokyo Institute of Technology
2. Chuo University
3. McMaster University
Publisher
The Operations Research Society of Japan
Subject
Management Science and Operations Research,General Decision Sciences
Reference10 articles.
1. [1] D. Avis: Postscript to “What is the worst case behavior of the simplex algorithm?” In D. Avis, D. Bremner, and A. Deza (eds.): Polyhedral Computation (Centre de Recherches Mathématiques Series, Montréal, 2009), 145–147.
2. [2] D. Avis and O. Friedmann: An exponential lower bound for Cunningham's rule. Mathematical Programming, 161 (2017), 271–305.
3. [3] G.B. Dantzig: Linear Programming and Extensions (Princeton University Press, Princeton, 1963).
4. [4] T. Kitahara and S. Mizuno: Klee-Minty's LP and upper bounds for Dantzig's simplex method. Operations Research Letters, 39 (2011), 88–91.
5. [5] T. Kitahara and S. Mizuno: Lower bounds for the maximum number of solutions generated by the simplex method. Journal of the Operations Research Society of Japan, 54 (2011), 191–200.