Question: Linear programming/regression 5. (30 points) The computer output for the solution of the following LP problem is given in the next page. Min 15x1 +
Linear programming/regression

5. (30 points) The computer output for the solution of the following LP problem is given in the next page. Min 15x1 + 15x2 + 16x3 s.t. 1x1 + 1x3 20 x1, x2, x3 (A) Which constraints are non-binding? Answer (6 points): (B) What will be the optimal value of the objective function if the objective function coefficient of variable x2 changes to 14.5? Answer (6 points): (C) Give the optimal values of all the variables and objective function when the objective function coefficient of x1 is increased by 0.5? Answer (6 points): Variables: Objective function value = (D) What is the range of feasibility of the right hand side of the 2nd constraint? Answer (6 points) (E) What is the maximum possible value by which the right hand side of the 3rd constraint can be decreased to stay within the range of feasibility? Answer (6 points)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
