The Simplex algorithm and its variants fall in the family of edge-following algorithms, so named because they solve linear programming problems by moving from vertex to vertex along edges of a polytope.
Simplex pivot methods preserve primal (or dual) feasibility.