SOLUTION: here is linear programming question I am having trouble with. Can you show me how to solve this problem in the most easy to use fashion?
For the following Linear Programming pro
Question 1085907: here is linear programming question I am having trouble with. Can you show me how to solve this problem in the most easy to use fashion?
For the following Linear Programming problem answer the questions (a) to (e) below:
Max Z = 3x + 2y
Subject to:
2x + y <= 8
x + y >= 4
y <= 10
x, y >= 0
(a) Solve the problem to find the optimum solution. Clearly label and show the feasible solution space on your diagram.
(b) Over what range can the coefficient for the first product vary in the objective function before the current solution is no longer optimal?
(c) Over what range can the coefficient for the second product vary in the objective function before the current solution is no longer optimal?
(d) Compute the shadow prices for the constraints.
(e) Calculate the Right Hand Side Ranges for the constraints.
You can put this solution on YOUR website! .
.
.
.
The feasible region is shown in purple with vertices of (0,4), (0,8), and (4,0).
Check the value of Z at these three vertices to find the maximum value.
.
.
.
The sensitivity analysis required in the remaining questions is beyond the scope of this website.
.