The basic algorithm for solving a standard minimization problem is covered in Section 4.3. This process, called the Simplex Method, uses matrices and row operations to gauge whether an objective function is maximized at corner points.

In the example below, I write out a standard maximization problem from an application and then solve it with the Simplex Method.