Question: Consider the following all-integer linear program. Max 1 x 1 + 1 x 2 s.t. 5 x 1 + 6 x 2 41 1 x

Consider the following all-integer linear program.

Max 1x1 + 1x2
s.t.
5x1 + 6x2 41
1x1 + 7x2 28
2x1 + 1x2 15
x1, x2 0 and integer

(a)

Graph the constraints for this problem. Use dots to indicate all feasible integer solutions. (choose one graph below)

(b)

Solve the LP Relaxation of this problem.

at (x1, x2) =

(c)

Find the optimal integer solution.

at (x1, x2) =

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock 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

Students Have Also Explored These Related General Management Questions!