QUESTION 18 Formulation Problem: points A pastry chef at a bakery wants to find the best mix of two cake recipes (Recipe 1 & Recipe 2) by using flour quality A & B in each recipe in order to maximize the Profit per cake recipe. Profit for recipes (Recipe 1 & Recipe 2) are shown in the last column of the table below. Maximum availability of flour: quality A & quality B are shown in the table below. Minimum Demand for cake: Cake 1 & Cake 2 units are also listed in the table below. Formulate as LPP (But do not solve it). nata: Minimum Demand for cake: Cake 1 & Cake 2 units are also listed in the table below. Formulate as LPP (But do not solve it). Data: Recipes Input (Flour) Output (Cake) Profit ($) Quality A Quality B Chocolate Cake Vanilla Cake 2 4 8 7 100 3 6 9 2 300 Recipe 1 Recipe 2 Recipe 3 Availability 1 5 7 5 200 400 500 Demand 150 Demand 250 The model for the above problem is as follows: Max. Z = C1X1 + C2X2 + C3X3 Subject to: 21X1 + a2x2 + 3x3 ? 1 24x1 + a5x2 +86x3 ? b2 a7x1 + agx2 + agx3 ? b3 a10X1+ a11x2 +212x3 ? 14 X1, X2, X320 Flour Quality 1 availability Flour Quality 2 availability Chocolate Cake Demand Vanilla Cake Demand Constraint (1) Constraint (2) Constraint (3) Constraint (4) Q1) What is the C1 Value Q2) What is the a3 Value Q3) What is the a7 Value V Q4) What is the a5 Value Q5) What is the ag Value Q6) What is the b2 Value V Q7) What is the b4 Value Q8) What is the sign of 1st constraint