Dantzig pivot rule
= Dantzig pivot rule
{c}
= Dantzig's rule
{c}
{synonym}
In maximization, select the entering nonbasic variable with greatest positive <reduced cost>, meaning objective increase per unit of that variable. Unlike geometric steepest-edge pricing, this rate depends on variable and constraint scaling. A rescaled <Klee-Minty cube> can give the same $2^n-1$-pivot path as smallest-index improving-facet pivoting.