**Solving a Standard Minimum Problem with Duals**

**a.** Find the dual standard maximization problem.

**b.** Solve the maximization problem using the simplex method.

**c.** The minimum value of the objective function w is the maximum value of the objective function z.

**d.** The optimum solution is given by the entries in the bottom row of the columns corresponding to the slack variables, so long as the entry in the z column is equal to **a**.