3 citations · 5 across the 5 of their papers we have counts for
Showing 2011 · math.OCShow all
2 papers · 2 filters
math.OC2011★ 1 cited
Klee-Minty's LP and Upper Bounds for Dantzig's Simplex Method
Tomonari Kitahara, Shinji Mizuno
Kitahara and Mizuno (2010) get two upper bounds for the number of different basic feasible solutions generated by Dantzig's simplex method. The size of the bounds highly depends on…
math.OC2011★ 3 cited
A Bound for the Number of Different Basic Solutions Generated by the Simplex Method
Tomonari Kitahara, Shinji Mizuno
In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solu…