Systems of Inequalities / Linear Programming
Constraints:
3x+3y >= 12
2x+4y >= 12
x >= 0
y >= 0
Minimize:
C = 6x + 5y
b) If the first two constraints were <= and you were maximizing the same objective function, what would the new answer be?