Final answer:
Lucy Ball should use linear programming to decide how many sets of silver and brass magnetic spheres to stock within the constraints of selling no more than 2000 sets and not exceeding $20,000 in inventory. The profit function to be maximized is 3x + 5y for silver and brass sets, respectively. Exact numbers and maximum profit cannot be determined without further graphing and optimization calculations.
Step-by-step explanation:
To solve this, we need to establish two equations that represent the constraints placed on Ms. Ball: the inventory investment limit and the maximum units that can be sold. Let x be the number of sets of silver magnetic spheres and y be the number of sets of brass magnetic spheres.
Firstly, the number of sets constraint is represented as:
Secondly, the investment constraint, based on the cost of silver and brass sets, is:
Ms. Ball's profit is calculated by multiplying the number of each type of set by the profit per set, so the profit function she wishes to maximize is:
To maximize her profit, Ms. Ball should use linear programming to find the combination of x and y that provides the highest profit while staying within both constraints. This typically involves graphically plotting the constraints to find the feasible region and then identifying the corner points of this region. The maximum profit will be at one of these corner points. The exact number of sets to stock for the maximum profit can be found using methods from calculus or simplex algorithm if done algebraically.
With the provided information, there isn't enough data to compute the exact numbers of sets she should stock for each type or the exact maximum monthly profit. Additional steps would involve graphing the constraints and using optimization techniques to find the solution.