Question: solve the following problem. max 5X +6Y s.t 17X + 8Y
solve the following problem.
max 5X +6Y
s.t 17X + 8Y <= 136
3X + 4Y <= 36
X, Y >= 0 and integer
a. indicate all feasible solutions (i.e the coordinates of the corners of the feasible region)
b. find the optimal solution to the LP relaxation. round down to find a feasible integer solution. in this solution optimal?
c. find the optimal solution
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
