Determin values for X and Y as will: Maximize 8X + 11Y
3X + 2Y <= 12
4X + 7Y <= 28
Y >= 0
X >= 0
X and Y are now to be integer, so the (X,Y) combinations that approximate continuous solution are : (3,3),(2,3),(2,2),(3,2)
...so which of these are a feasible solution to a new integer programming problem?
is (X=2, Y=2) the optimal solution to the interger programming problem?