To find the maximum weekly income, we can use a linear programming approach. Let's define the variables:
- Let x be the number of model A light fixtures to be made.
- Let y be the number of model B light fixtures to be made.
We need to maximize the weekly income, which can be calculated as follows:
Income = (selling price of model A * number of model A) + (selling price of model B * number of model B)
Subject to the following constraints:
- Assembly time constraint: 12x + 18y ≤ 240 hours
- Packaging time constraint: 2x + y ≤ 20 hours
- Non-negativity constraint: x ≥ 0, y ≥ 0
Now we can solve this linear programming problem to find the optimal values of x and y that maximize the weekly income.