Time remaining: $04$:$4$

In the simplex method for linear programming what does each pivot operation represent?

A move to a less optimal extreme point.

A switch to a parallel feasible region.

An arbitrary jump within the feasible region.

A move to an adjacent extreme point with a better objective value.

A recalibration of the objective function.