Problem:
Solve the linear programming problem by the simplex method
Minimize C = 9x + 13y
Subject to x + 3y ≥ 12
2x + 2y ≥ 8
x ≥ 0, y ≥ 0
a. x = -2, y = -2, C = 44
b. x = 2, y = 2, C = 44
c. x = -2, y = 2, C = -44
d. x = 2, y = 2, C = -44
Additional Information:
This problem is basically from Mathematics as well as it is about solving linear programming problem using simplex method.