Question: 3. Consider the following all-integer linear program: 1x + 1x Max s.t. 4x1 + 6x2 22 1x + 5x 15 2x + 1x 9 X1,
3. Consider the following all-integer linear program: Maxs.t.1x1+1x24x1+6x2221x1+5x2152x1+1x29x1,x20andinteger a. Graph the constraints for this problem. Use dots to indicate all feasible integer solutions, b. Solve the LP Relaxation of this problem. c. Find the optimal integer solution
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
