Final answer:
The linear programming model for this problem is to maximize the profit by producing a certain number of cases of Lemonade and Coca-Cola, subject to constraints on the available water and sugar.
Step-by-step explanation:
The problem can be solved using linear programming techniques. Let's define the decision variables:
x = number of cases of Lemonade
y = number of cases of Coca-Cola
The objective is to maximize the profit, which is given by:
Profit = 3x + 4y
Now, let's set up the constraints:
Water constraint: 9x + 9y <= 900
Sugar constraint: 0.6x + 0.9y <= 72
Non-negativity constraint: x >= 0 and y >= 0
The linear programming model for this problem is:
Maximize 3x + 4y
Subject to:
9x + 9y <= 900
0.6x + 0.9y <= 72
x, y >= 0