Linear Programming and Simplex Method

Linear programming optimizes a linear objective under linear constraints, and the simplex method walks the feasible region's corners to find the optimum.