Linear programs (LPs) can be solved through a polynomial number of so-called deepest-descent circuit steps, each step following a circuit direction to a new feasible solution of most-improved objective function value.
<meaning-changed> Linear programs (LPs) can be solved through a polynomial number of so-called deepest-descent circuit steps, each step following a circuit direction to a new feasible solution of most-improved objective function value.
Linear programs (LPs) can be solved by polynomially many moves along the circuit direction improving the objective the most, so-called deepest-descent circuit steps, each step following a circuit direction to a new feasible solution of most-improved objective function value.