In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the dual simplex method with Dantzig's rule for LP. The bound is comparable with the bound given by Kitahara and Mizuno (in press)  for the primal simplex method. We apply the result to the maximum flow problem and get a strong polynomial bound.
All Science Journal Classification (ASJC) codes
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics