1. **Problem Statement:** We want to formulate a linear programming (LP) model for a Baby Food Manufacturing Company that produces two products, x and y, to maximize profit. 2. **Decision Variables:** Let $x$ = number of units of product x Let $y$ = number of units of product y 3. **Objective Function:** Maximize profit $Z$ given by: $$Z = 200x + 175y$$ 4. **Constraints:** - Fat constraint: product x uses 7 kg, product y uses 6 kg, maximum 540 kg $$7x + 6y \leq 540$$ - Protein constraint: product x uses 7 kg, product y uses 15 kg, maximum 945 kg $$7x + 15y \leq 945$$ - Carbohydrate constraint: product x uses 10 kg, product y uses 13 kg, maximum 510 kg $$10x + 13y \leq 510$$ - Non-negativity constraints: $$x \geq 0, \quad y \geq 0$$ 5. **Final LP Model:** Maximize $$Z = 200x + 175y$$ Subject to: $$\begin{cases} 7x + 6y \leq 540 \\ 7x + 15y \leq 945 \\ 10x + 13y \leq 510 \\ x, y \geq 0 \end{cases}$$ This completes the model formulation for the given problem.