Question: Consider the following all-integer linear program: Max 1x1 + 1x2 s.t. 4x1 + 6x2 22 1x1 + 5x2 15 2x1 + 1x2

Consider the following all-integer linear program:
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

1 Expert Approved Answer
Step: 1 Unlock

a b The optimal solution to the LP Relaxation is shown on the above graph to be x 1 4 ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

148-M-O-G-L-P (138).docx

120 KBs Word File

Students Have Also Explored These Related Optimization Questions!