The optimal solution to the linear programming problem is to produce 560 ounces of Whole (W) sauce and 240 ounces of Marinara (M) sauce. The output from the program is listed below:
Objective Function Value: 860
Whole Sauce 560
Marinara Sauce 240
Constraint Slack/Surplus Dual Prices
1 0 .125
2 160 0
3 0 0.187
OBJECTIVE COEFFICIENT RANGES
Variable Lower Limit Current Value Upper Limit
W 0.893 1.0 1.25
M 1.0 1.25 1.40
RIGHT HAND SIDE RANGES
Constraint Lower Limit Current Value Upper Limit
1 4,320 4,480 5,600
2 1,920 2,080 No Upper Limit
3 1,280 1,600 1,640
a. If the company finds a way to improve their productivity so that they can increase their profit per jar substantially, what is the maximum profit per jar they can obtain while still using this optimal solution? Give the maximum profit per jar for both types of sauce.
b)List the constraint(s) that are not binding and interpret their slack/surplus variable(s).
c)What does it mean that the right-hand side range of constraint 2 has no upper limit?
Recently Asked Questions
- What is a situation in which members of a religion experience religious oppression
- Try to write a subroutine to test whether the bit 7,5 and 2 of an 8-bit value passed in r16 are 101. if these 3 bit are 101, a 1 is returned in 22. Otherwise,
- PLEASE READ: The only thing I want to learn are the step by step of what to punch in the calculator HP10BII+ financial calculator , I'm trying to learn what to