A bound for the number of basic feasible solutions generated by the simplex method with the maximum distance rule

Abstract: In this paper, we consider the number of different basic solutions generated by the simplex method with the maximum distance rule. The pivoting rule was recently proposed, and in some cases, it was reported to be more efficient than the renowned steepest edge rule. If the problem is nondegenerate, these results provide bounds on the number of iterations. As far as we know, they are the first theoretical bounds for the maximum distance rule.