Question: Consider the following linear programming model: Max 2X + 4Y + 6Z Subject to Z 0 X + Y + Z 20 X, Y, Z
Consider the following linear programming model: Max 2X + 4Y + 6Z Subject to Z 0 X + Y + Z 20 X, Y, Z 0
Reference: LP Model 1
The optimal solution is (X, Y, Z) = (0, 20, 0). Which of the following statement is not correct?
| A. | The optimal objective function value greater than 60. | |
| B. | The first and second have slack zero. | |
| C. | The problem has has more than one feasible solution. | |
| D. | The last constraint means that decision variables can only take on positive integer values. | |
| E. | None of the above |
Consider the following linear programming model: Max 2X + 4Y + 6Z Subject to Z 0 X + Y + Z 20 X, Y, Z 0
Reference: LP Model 1
Knowing that the unit contribution of variable X has to increase by 2 before it can take a positive value in the optimal solution, which of the following is true?
| A. | the shadow price is 2 | |
| B. | the shadow price is -2 | |
| C. | the reduced cost is -2 | |
| D. | the slack is 2 | |
| E. | None of the above |
Consider the following linear programming model: Max 2X + 4Y + 6Z Subject to Z 0 X + Y + Z 20 X, Y, Z 0
Reference: LP Model 1
Suppose that when the RHS of Constraint 1 increases by 3 units within the allowable range, the objective function increases by 6. Which if the following is true?
| A. | the solution did not change. | |
| B. | the reduced cost must be 2. | |
| C. | the shadow price must be 2 | |
| D. | the constraint is no longer binding. | |
| E. | None of the above |
Consider the following linear programming model: Max 2X + 4Y + 6Z Subject to Z 0 X + Y + Z 20 X, Y, Z 0
Reference: LP Model 1
Suppose that the objective function coefficient for variable Z increases by 1. What impact will this have on the current values of the optimal solution?
| A. | Solution will become infeasible | |
| B. | No change | |
| C. | Not enough information is provided | |
| D. | Current solution will change |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
