Save your answers in one excel file with three separate sheets. Don’t forget to name your file and the sheets properly. Please follow the rubric.
Problem 2:
The Crumb and Custard Bakery makes coffee cakes and Danish pastries in large pans. The main ingredients are flour and sugar. There are 25 pounds of flour and 16 pounds of sugar available, and the demand for coffee cakes is 5. Five pounds of flour and 2 pounds of sugar are required to make a pan of coffee cakes, and 5 pounds of flour and 4 pounds of sugar are needed to make a pan of Danish. A pan of coffee cakes has a profit of $1, and a pan of Danish has a profit of $5. Formulate a linear programming model for this problem so that profit will be maximized. Find the optimal solution with solver and generate sensitivity report. Determine binding constraints and their shadow prices. Why is the shadow price of non-binding constraints equal to zero?
Problem 3:
Moore’s Meatpacking Company produces a hot dog mixture in 1,000-pound batches. The mixture contains two ingredients—chicken and beef. The cost per pound of each of these ingredients is as follows:Chicken $3 (cost/lb.) Beef: $5
Each batch has the following recipe requirements:
a. At least 500 pounds of chicken b. At least 200 pounds of beef
The ratio of chicken to beef must be at least 2 to 1. The company wants to know the optimal mixture of ingredients that will minimize cost. Formulate a linear programming model for this problem. No sensitivity report is required.
0 comments