28 Consider the following two LPs:

Suppose that BV {x1, x2} is an optimal basis for both LPs, and the optimal solution to LP 1 is x1 50, x2 500, z 550. Also suppose that for LP 1, the shadow price of both Constraint 1 and Constraint 2
10 3 0
. Find the optimal solution to LP 2 and the optimal solution to the dual of LP 2. (Hint: If we multiply each number in a matrix by 100, what happens to B1?)

Transcribed Image Text:

max z cx + Cx s.t. 911x1 +912x2 = b a21x1 + a22x2 = b 0 max z=100c1x1 + 100c2x2 .t. 100a11x1 +100a12x2 b 100a2x+100a22x2 = b x1, x20