Question: Consider the following all-integer linear program: Max 5x1 + 8x2 s.t. 6x1 + 5x2 30 9x1 + 4x2 36 1 x1 + 2

Consider the following all-integer linear program:
Max 5x1 + 8x2
s.t.
6x1 + 5x2 ≤ 30
9x1 + 4x2 ≤ 36
1 x1 + 2 x2 ≤ 10
x1, x2 ≥ 0 and integer

a. Graph the constraints for this problem. Use dots to indicate all feasible integer solutions.
b. Find the optimal solution to the LP Relaxation. Round down to find a feasible integer solution.
c. Find the optimal integer solution. Is it the same as the solution obtained in part (b) by rounding down?

Step by Step Solution

3.50 Rating (183 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 given by x 1 143 x 2 429 with an objective funct... 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 (137).docx

120 KBs Word File

Students Have Also Explored These Related Optimization Questions!