I could really use some advice on how to approach it, thanks.
Find the complete optimal solution to this linear-programming problem:
Min 3X + 3Y
s.t. 12X + 4Y > 48
10X + 5Y > 50
4X + 8Y > 32
X , Y > 0
It would almost certainly be a graphical method, except that as formulated it has no solution.
(constraints should all he <= or >= otherwise the vertices of the feasible region are not in the
feasible region and so cannot be solutions)