Kitahara and Mizuno (2010)  get two upper bounds for the number of different basic feasible solutions generated by Dantzigs simplex method. The size of the bounds highly depends on the ratio between the maximum and the minimum values of all the positive elements of basic feasible solutions. We show that the ratio for a simple variant of KleeMintys LP is equal to the number of iterations by Dantzigs simplex method for solving it.
All Science Journal Classification (ASJC) codes
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics