The bounded version of this algorithm has a maximum runtime more or less linear in the problem size by the unfortunately false Hirsch conjecture. A pathological construct created to prove the exponential worst-case (15[1])complexity of the unbounded version of this algorithm is named after Klee (15[1])and Minty. (15[1]-5[1])Degeneracies (15[1])that cause cycling in this algorithm are fixed by Bland’s rule, which guarantees finite termination time. (*) Pivot rules are applied when performing this algorithm by hand to choose a non-basic and a basic variable (10[1])to swap within a tableau. This algorithm begins by using slack (10[1])variables (10[1])to convert (10[1])constraint inequalities to equations that define the feasible region. For 10 points, name this linear programming technique created by George Dantzig that solves optimization problems by moving between the vertices of a convex polytope. ■END■