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.40 Rating (166 Votes )
There are 3 Steps involved in it
a b The optimal solution to the LP Relaxation is shown on the above graph to be x 1 4 ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
148-M-O-G-L-P (138).docx
120 KBs Word File
