Question: Consider the following all-integer linear program: Max 1x1 + 1x2 s.t. 4x1 + 6x2 ( 22 1x1 + 5x2 ( 15 2x1 + 1x2 (
Max 1x1 + 1x2
s.t.
4x1 + 6x2 ( 22
1x1 + 5x2 ( 15
2x1 + 1x2 ( 9
x1, x2 ( 0 and integer
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
3.51 Rating (158 Votes )
There are 3 Steps involved in it
a Graph of the constraints with the given inequalities Begin by graphing the lines corresponding to ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
1137-M-S-Q-M(1825).docx
120 KBs Word File
