Question

In: Operations Management

Linear Programming The Whole Food Nutrition Centre uses three bulk grains, A, B, and C, to...

Linear Programming

The Whole Food Nutrition Centre uses three bulk grains, A, B, and C, to blend a natural cereal that it sells by the pound. The cost of each bulk grain is indicated in the table below, along with the units of four types of nutrient (Nutrient 1, 2, 3, and 4) that is contained in each pound of the grains.  

After consulting with the nutritionist, Whole Food has determined that each pound serving of the cereal should contain 24 units of Nutrient 1, 16 units of Nutrient 2, 8 units of Nutrient 3, and 3.4 units of Nutrient 4. Whole Food wishes to decide how to blend the three types of grain in order to minimize the total cost of each pound of the cereal. In other words, they wish to solve the following optimization:  

Minimize 33A + 47B + 38C Subject to:  

22A + 28B + 21C ≥ 24

16A + 14B + 25C ≥ 16  

8A+7B +9C≥8 5A + 6C ≥ 3.4  

A+B +C=1 A,B,C 0  

Grain A  

Grain B  

Grain C  

Nutritionist's requirement  

Nutrient 1  

22  

28  

21  

24  

Nutrient 2  

16  

14  

25  

16  

Nutrient 3  

8  

7  

9  

8  

Nutrient 4  

5  

0  

6  

3.4  

Cost per pound of grain (cents)  

33  

47  

38  

  1. Solve this problem in Excel using Solver and Report the results to the manager of Whole Food in plain English.   

  1. Based on the solution you found in (1), how many constraints regarding the nutrients are binding. For each of the non-binding constraints, what is the surplus?   

In order to gain more insights, Whole Food obtained sensitivity report in Solver. This will help you to answer Questions (4)-(6) below.  

  1. How sensitive is Whole Food’s blending strategy to the cost per pound for each type of grains individually? Which is it most sensitive to?   

  1. If the cost of Grain B changes to 40 cents per pound, while all other costs remain the same, should Whole Food keep its current blending strategy or change it? Why or why not?   

  1. If the nutrient requirement for Nutrient 2 increases from 16 units to18 units, should Whole Food keep its current blending strategy or change it? Why or why not?

Solutions

Expert Solution

1)

Create Excel model as follows:

Enter Solver Parameters as follows:

Click Solve to generate results. After clicking, values appear automatically in yellow cells.

On the Solver Results window, check Sensitivity to generate sensitivity report

Click OK

Sensitivity report

-------------------------------------------------------------------------------------------------

2)

Binding constraint is one, whose Final Value is equal to the Constraint R.H. Side.

Looking at the sensitivity report, we see that Nutrient 1, 3 and 4 are binding constraints. and last constraint (A+B+B=1) is also a binding constraint.

Nutrient 2 is non-binding constraint. For non-binding constraint, surplus = Final Value - Constraint R.H. Side

Surplus for Nutrient 2 = 18.8 - 16 = 2.8

-------------------------------------------------------------------------------------------------

3)

Refer Variable Cells section of the Sensitivity report, Allowable Decrease for C is 7.33, which is the lowest

This means that this strategy is more sensitive to nutrient C.

If cost of B is reduced by more than 7.33 cents, then optimal solution will change

-------------------------------------------------------------------------------------------------

4)

If the cost of grain B is changed to 40 cents per pound, this is a a decrease of 7 cents, from the current price of 47 cents. But its allowable decrease is 19. Hence, current blending strategy will NOT change.

-------------------------------------------------------------------------------------------------

5)

Refer Constraints section of the Sensitivity report,

Allowable increase for Nutrient 2 is 2.8

Increase from 16 to 18 units is only 2 , which is less than allowable increase.

Therefore, current blending strategy will NOT change.


Related Solutions

Whole Grains Inc. uses statistical process control to ensure that its health-conscious, low-fat, multigrain sandwich loaves...
Whole Grains Inc. uses statistical process control to ensure that its health-conscious, low-fat, multigrain sandwich loaves have the proper weight. Based on periodic process sampling, the following observed weights (in ounces) were recorded: Sample 1 Sample 2 Sample 3 Sample 4 Sample 5 Sample 6 Loaf # 1 5.94 6.18 5.94 6.18 6.18 4.74 Loaf # 2 7.02 5.58 5.94 7.02 5.58 5.40 Loaf # 3 6.00 6.12 6.48 6.60 5.64 6.60 Loaf # 4 6.90 5.40 6.30 4.80 4.50...
You are a manager that uses Excel to find the optimal solution to a linear programming...
You are a manager that uses Excel to find the optimal solution to a linear programming problem. Before implementing the solution, what should you do?
Non-negativity is always present in a linear programming problem. A) True B) False In all linear...
Non-negativity is always present in a linear programming problem. A) True B) False In all linear programming problems, the maximization or minimization of some quantity is the objective. A) True B) False All linear programming problems have at least one feasible solution. A) True B) False The point (0,0) is always part of the feasible region. A) True B) False The optimal solution for a linear programming problem occurs when the objective function intersects with at least one of the...
c++ programming: Given: Struct myq { double a,b,c };      X1= -b + sqrt(b*b-4 * a*...
c++ programming: Given: Struct myq { double a,b,c };      X1= -b + sqrt(b*b-4 * a* c)/2 *a;       X2= -b- sqrt(b*b- 4 * a * c)/2 * a;       X0f v= (-b)/( 2*a);       a>0 if maximum otherwise it is minimum        b*b – 4*a*c >0    two unrepeated roots        b*b- 4 * a* c =0 two repeated roots        b*b- 4 * a* c <0 two complex roots Write a function with an argument to calculate x1, make...
Solve the linear programming problem by the method of corners. Minimize C = 2x + 5y    ...
Solve the linear programming problem by the method of corners. Minimize C = 2x + 5y     subject to   4x + y ≥ 38 2x + y  ≥ 30 x + 3y  ≥ 30 x ≥ 0, y ≥ 0  
Use the method of this section to solve the linear programming problem. Minimize   C = 2x...
Use the method of this section to solve the linear programming problem. Minimize   C = 2x − 3y + 6z subject to   −x + 2y − z ≤ 9 x − 2y + 2z ≤ 10 2x + 4y − 3z ≤ 12 x ≥ 0, y ≥ 0, z ≥ 0   The minimum is C =   at (x, y, z) =    .
There are A, B and C, three plastic balls, A and B, B and C, C...
There are A, B and C, three plastic balls, A and B, B and C, C and A are attracted to each other, if A is positive: Group of answer choices 1. Both B and C are negatively charged. 2. One of the B balls and the C balls is going to be negatively charged and the other one is not charged 3. B ball, C ball has no charge 4. B ball is negatively charged, C ball is positively...
2. A. An infeasible linear programming model is caused by the (a) objective function (b) constraints...
2. A. An infeasible linear programming model is caused by the (a) objective function (b) constraints (c) Both (a) and (b) (d) None of the above (b) Which of the following nations is least active in entrepreneurial activities?                         (a) China (b) Japan (c) Thailand (d) Canada c. Name two reasons and clearly explain how they have contributed to the huge number of   small businesses in the United States:
What are three reasons why Linear Programming has value in a variety of fields?
What are three reasons why Linear Programming has value in a variety of fields?
C Programming- How would the whole part 1 be coded with multiple loops? Part 1: You...
C Programming- How would the whole part 1 be coded with multiple loops? Part 1: You can do A, B, and C in one program with multiple loops (not nested) or each one in a small program, it doesn’t matter. A. Create a loop that will output all the positive multiples of 9 that are less than 99. 9 18 27 36 45        …. B. Create a loop that will output all the positive numbers less than 200 that are...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT