Problem 5. {10 pta ) Standard/General Maximization LP Problems, the Simpler Method (a) (2 pta.) List the two kinds of constraints we have on our variables in a standard maximization problem. (b) (2 pts.} Identify the pivot in this simplex tableau. up 0 0 0 48 24 31 31 (3 0 01 36 12 p -15 -20 0 0 0 1 0 (c) (1 pt.) What do we do when we encounter & general minimization problem? (Circle one) Maximize the negative of the objective function . Log out of WebAssign . Turn all of the nonnegative constraints into nonpositive constraints (d) Fill in the active variables column (2 pta.) and interpret the solution given by this final simplex tableau (3 pts.). Assume c, r. and g are our original variables, s, b, u were slack variables, and p is the profit. UP 3/2 1 -1/100 20 -1/2 0 -1 1/100 0 0 15 0 -3/2 0 1/100 10 5 5000 0 10000 100 850000 15 Optimal solution: -$ $5 0090