Question: Consider the following linear programming problem and its optimal final solution: max 2x1 + x2 - x3 s.t. x1 + 2x2 + x3 8 -x1
Consider the following linear programming problem and its optimal final solution: max 2x1 + x2 - x3 s.t. x1 + 2x2 + x3 8 -x1 + x2 - 2x3 4 x1, x2, x3 0 The optimal solution is x1 = 8, x2 = 0
a. Suppose that the coefficient of x2 in the first constraint is changed from 2 to 0.25. Using sensitivity analysis, find the new optimal solution. b Suppose that the following constraint is added to the problem: x2 + x3 = 3.Using sensitivity, find the new optimal solution.
Please provide detailed process for each solution
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
