Hi, your question appears to be unclear. However, I inferred this to be a linear programming problem.
Answer:
$500
Explanation:
To begin we need to state the system of inequalities for this situation (constraints):
- For the number of available beads:
where b represents the number of bracelets made, and n represents the number of necklaces made.
- For the available time to make the jewelry:

From the question, we note we are required to find the maximum revenue that the craftsman can take in. In other words, the optimization equation is
= maximum revenue (taking note that a bracelet costs $5 and a necklace costs $7.50)
Next, we are to plot the inequalities on a graph to determine the feasible region: Doing so should give us these main vertices: (0,0) (0,40) (40,30 (100,0).
By substituting the vertices into the optimization equation (replacing b, and n) we can determine which quantity gives the maximum revenue:
For (0,40) ⇒ 5(0) + 7.5(0) = $0
For (0,40) ⇒ 5(0) + 7.5 (40) = $300
For (40, 30) ⇒ 5(40) + 7.5 (30) = $425
For (100, 0) ⇒ 5(100)+7.50(0) = $500
We notice that at point (100, 0) we have a maximum revenue of $500.