Question: When I solve the linear program: max 2x1 + 5x2 s.t. 2xi + 12 0 via the Simplex algorithm with slack variables s, 2 to

When I solve the linear program: max 2x1 + 5x2

When I solve the linear program: max 2x1 + 5x2 s.t. 2xi + 12 0 via the Simplex algorithm with slack variables s, 2 to the first and second constraints respectively, I end up with the following tableau: 12 S1 S2 1 0 0 -0.2 -1.6-26 1 0 0.6 -0.2 3 0 1 -0.2 0.4 4 Suppose C1 = 2 changes to chew = 1 in the objective function. Is x = [3,4]the optimal solution to the updated LP, with optimal value 23 ? Explain/show vour work. =

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!