Consider the following Linear Programming problem. The different lines represent the constraints while the shaded area represents the feasible region. a A 13 P - M O (6,10) O (2,2) O (0,0) O (8,5) O (1,4) 4 An x Assume the objective function is: Minimize Z = 4x1 + x What is the optimal solution? A regional chain of bakeries developed a Linear Programming model to identify the production plan that would optimize profits. The optimal production plan specifies what items to produce based on the estimated profit for each product and four key resources: butter, eggs, flour and labor. The model was recently solved using Excel, and the following report was generated. Adjustable Cells Cell Name $B$22 Units Produced Cake $C$22 Units Produced Custard Pie Constraints Name Reduced Cost 0 -1.150000001 40 Final Value Final Value Shadow Price 40 480 40 30 0 Allowable Increase 5.199999999 1.150000001 Objective Coefficient 1E+30 Cell $B$28 Butter Required $B$29 Eggs Required $B$30 Flour Required $B$31 Labor Hours Required Based on the model results, how many resources have been used up? 6.35 0 0 0 6.35 Allowable Increase 40 1.666666667 500 Constraint R.H. Side 50 40 Allowable Decrease 1E+30 1.150000001 1E+30 1E+30 1E+30 Allowable Decrease 40 20 10 10 $B$29 Eggs Required $B$30 Flour Required $B$31 Labor Hours Required Based on the model results, how many resources have been used up? 4 02 O 3 01 00 9.33 0 480 40 30 0 0 40 1.666666667 500 50 40 1E+30 1E+30 1E+30 40 20 10 10