The simplex algorithm begins at a starting vertex and moves along the edges of the polytope until it reaches the vertex of the optimum solution.
a method for solving problems in linear programming that tests adjacent vertices of the feasible set in sequence so that at each new vertex the objective function improves or is unchanged.