(Solved): 1. Consider the linear programming problem and its optimal tableau: min 3x1 + 4x2 subject to 3x1 + ...

1. Consider the linear programming problem and its optimal tableau: min 3x1 + 4x2 subject to 3x1 + x2 > 4 21 + 2.02 > 4 X1, X2 > 0. 2 X 1 X2 X3 X4 RHS 2 44 0 0 crito - - 5 1 0 X 1 1 0 -- C710 OTTA X 2 0 0 1 1 5 - orico Vio (a) Append an additional constraint x1 + x2 > 3 in the above optimal tableau. Does the original optimal solution remain optimal? (b) Write the dual and find an optimal solution of dual from the above tableu.