Tutorial Exercise Set up the simplex matrix used to solve the linear programming problem. Assume all variables are nonnegative. Maximize f = 9x+5y subject to 2x + 7y 600 x + 6y 375. Step 1 We want to set up the simplex matrix that would be used to maximize f = 9x+5y subject to the following constraints. 2x + 7y 600 x + 6y 375 We start by converting the constraint inequalities into equations by usin ---Select--- variables, s and s. This gives 2x + 7y+5 = 600 x + 6y+ = 375. static slack dynamic