Question: 1. A linear programming model is given as follows: Maximize s.t. 20x1 + 47x2 50x1 + 24x2 50 21 X2 > 0 Solve the problem

1. A linear programming model is given as

1. A linear programming model is given as follows: Maximize s.t. 20x1 + 47x2 50x1 + 24x2 50 21 X2 > 0 Solve the problem by using the computer. (a) What are the optimal objective function value and the optimal point? (b) Obtain the values of the slack/surplus variables at the optimal solution in (a) (c) Identify the sensitivity range of the objective function coefficient of X1. (d) Identify the sensitivity range of the value of the 1st resource constraint (right-hand side). (e) Identify the sensitivity range of the value of the 2nd resource constraint (right-hand side). (f) which of the following makes the model infeasible? (Choose one) (i) Increase of the coefficient of Xi on the objective function to 3000 (ii) Decrease of the coefficient of x on the 2nd constraint to -5000 (iii) Addition of a new constraint, x2 > 50 (iv) Removal of the non-negativity constraints for X1, X2 (v) None

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!