This process is covered in Section 4.4 of the textbook. For complete details on the process, consult this section and the many examples contained in this section. I will assume that you have looked over this section and are familiar with carrying out row operations on a matrix.
Let’s take a look at a problem that requires a bit of ingenuity to put into standard minimization form.
Problem – Garton’s Seeds has a seed mixture containing three types of seeds: bluegrass, rye, and Bermuda. The cost per pound of the three seeds are 16 cents, 14 cents and 12 cents. Bluegrass seed must be at least 25% of the each batch. The amount of Bermuda must be no more than 2/3 the amount of rye in each batch. To fill current orders, Garton’s must make at least 6000 lbs of the mixture. How many pounds of each seed should be in the batch so that the cost of the batch is minimized?
The basic algorithm for solving a standard maximization 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.