Question: Consider the following LP problem and the corresponding simplex tableaus. Max x1 + 2x2 s.t x1 + 3x2 x1 + x2 x1, x2 >= 0
Consider the following LP problem and the corresponding simplex tableaus.
Max x1 + 2x2
s.t x1 + 3x2
x1 + x2
x1, x2 >= 0
a) At what rate in what direction will the optimal objective function value change as b1 decreases?
b) Suppose a new variable, say x5, is added to the problem. Its objective coefficient is 4, coefficient in constrain 1 is 4, and coefficient in constraint 2 is 2.
i. Does this cause the original optimal solution to be infeasible? Explain.
ii. Does this cause the original optimal solution to be suboptimal (but still feasible)? Explain.
c) Suppose the value of c2 is changed. Indicate whether x2 is basic or nonbasic in the final solution and circle the numbers in the final tableau that will change because of the change in c2.

Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
