Consider the following MILP: Minimize Z = 5x1 + 2x2

s.t. 3x1 + 6x2 >= 18

5x1 + 4x2 >= 20

8x1 + 2x2 > 16

7x1 + 6x2 <= 42

x1 >= 0 and integer

x2 >= 0

The following is a plot of the equalities of the above constraints:

 

a) What is the optimal answer? That is:

x₁ = ___ ; x₂ = ___ ; S1 = ___; S2 = ____; S3 = ____; S4 = ____; Z = ______ ;

d) What will be the answers below if the objective function is changed to Maximize 2x₁ + 5x₂:

x₁ = ___ ; x₂ = ___ ; Z = ______ ;

Transcribed Image Text:

X2 7 6 5 4 3 2 1 O 3.0 XT-6.0x2= 18.0 1 : 3.0X1+ 6:0X2 >= 18.0 : 5.0X1+ 4.0X2>= 20.0 : 8.0X1+ 2.0X2> 16.0 : 7.0X1+ 6.0X2<= 42.0 : 30X1+ 4.0X2= 20.0 8.0 X1+ 2.0 X2= 16.0 2 3 7.0 %1+ 6.0 X2= 42.0 4 5 6 X1 Payoff: 5.0 X X2 7 6 5 4 3 2 1 O 3.0 XT-6.0x2= 18.0 1 : 3.0X1+ 6:0X2 >= 18.0 : 5.0X1+ 4.0X2>= 20.0 : 8.0X1+ 2.0X2> 16.0 : 7.0X1+ 6.0X2<= 42.0 : 30X1+ 4.0X2= 20.0 8.0 X1+ 2.0 X2= 16.0 2 3 7.0 %1+ 6.0 X2= 42.0 4 5 6 X1 Payoff: 5.0 X

Answer rating: 100% (QA)

To solve for the MILP we need to first find the feasible region on the graph So looking at the const... View the full answer