Problem 3 (10 points): Construct a linear programming problem in standard form that solves the following problem. Do NOT solve the problem, but find the values of x1, x2, and x3 that will minimize T1 = 4x2 - 5x3 subject to the constraints:
I1 + 3x2 < 5
T2 + 4x1 + 27x2 + 9x3 + 11x2 < l
I2 > 0
x3 unrestricted