What Does the Simplex Method Solve?
The Simplex algorithm solves Linear Programming (LP) problems by finding the optimal value of a linear objective function subject to a system of linear constraints. Geometrically, the feasible region forms a convex polyhedron, and the fundamental theorem of linear programming proves that an optimal solution always lies at an extreme point (vertex). Instead of evaluating every vertex, Simplex iteratively moves along adjacent edges with improving objective values until no better adjacent vertex exists.