1) Use the simplex method to solve the linear programmingproblem. Maximize P = 6x + 5y subject to 3x + 4y ≤ 34 x + y ≤ 10 3x+ y ≤ 28 x ≥ 0, y ≥ 0   The maximum is P = at (x, y) =
2) Use the simplex method to solve the linear programmingproblem. Maximize P = x + 2y + 3z subject to 2x + y + z ≤ 21 3x +2y + 4z ≤ 36 2x + 5y − 2z ≤ 15 x ≥ 0, y ≥ 0, z ≥ 0   The maximum isP = at (x, y, z) =
