Solve the following LP using the simplex method. 4x1 + 2x2 maximize subject to -x1 +...

Transcribed Image Text:

Solve the following LP using the simplex method. 4x1 + 2x2 maximize subject to -x1 + x2 < 2 4x1 x24 x1, x2 0 Use the Danzig rule (pick a variable with the most negative coefficient in z-row) to select the entering variable at each step. Step 0: Z x1 x2 s1 s2 rhs BV Ratio 1 00 0 Z 0 0 10 s1 01 s2 Step 1: z x1 x2 s1 s2 rhs BV Ratio 10 0 Z 00 3/4 01 0 1/4 s1 Step 2: z x1 x2 s1 s2 rhs BV 100 Z 001 4/3 01 The optimal solution is: x1= x2= Z= 2 x1 Solve the following LP using the simplex method. 4x1 + 2x2 maximize subject to -x1 + x2 < 2 4x1 x24 x1, x2 0 Use the Danzig rule (pick a variable with the most negative coefficient in z-row) to select the entering variable at each step. Step 0: Z x1 x2 s1 s2 rhs BV Ratio 1 00 0 Z 0 0 10 s1 01 s2 Step 1: z x1 x2 s1 s2 rhs BV Ratio 10 0 Z 00 3/4 01 0 1/4 s1 Step 2: z x1 x2 s1 s2 rhs BV 100 Z 001 4/3 01 The optimal solution is: x1= x2= Z= 2 x1