Consider the following linear programing problem: Maximize Z=200X1 + 200X2 Subject to: 2X1 + 4X2 0 When we solve the problem using the Simplex Method in tabular form, we get the final optimal solution tableau: When we solve the problem using the Simplex Method in tabular form, we get the final optimal solution tableau: $200 $200 $0 $0 SOLUTION MIX S, X, X, 1 0 QUANTITY $200 S2 -0.2 0.6 3 200 0 1 -0.2 0.4 2 X X 2 0; - ; $200 $200 $80 $40 $1,000 0 0 -80 -40