We give an upper bound for the number of different basic feasible solutions generated by Dantzigâ€™s simplex method (the simplex method with the most negative pivoting rule) for LP with bounded variables by extending the result of Kitahara and Mizuno (2010). We refine the analysis by them and improve an upper bound for a standard form of LP. Then we utilize the improved bound for an LP with bounded variables. We show some results when the bound is applied to the minimum cost flow problem and the maximum flow problem.

## Citation

To appear in Pacific Journal of Optimization.