Practice 1 Solutions
Given the graph, find the minimum and maximum values using the objective function.
This problem has one minimum at (2, 0) and one maximum at (1, 6).

This problem has one minimum at (4, 1) and one maximum at (1, 4).

Write a system of inequalities given the graph. Then use the objective function to find the minimum and maximum.
Note
The inequality with a fractional y‑intercept can be found by using the points (1, 3) and (7, 0).

The minimum is at (1, 3). There is no maximum because this is unbounded.
Note
Q: Why is there no maximum for this graph?
A: This graph does not have an enclosed polygon, so this system is unbounded and therefore does not have a max.
Note
This can be found by m = 4,
(4, 3). Then use the point slope formula.

This problem has one minimum at (0, 4) and one maximum at (3, −1).
Note
You can check the inequalities using technology. The graph should match the one provided.
Q: How many inequalities are needed for the bounded region? Explain.
A: 4, because there are 4 graphed lines on the coordinate plane.
Note
Problems 5–10
You can use technology to graph these problems; however, you also need to be able to transfer the information onto a coordinate plane on paper.
Graph the system of inequalities. Name all of the vertices and evaluate using the objective function for the minimum and maximum values.
This problem has one minimum at (12, 0) and one maximum at (0, 5).

This problem has one minimum at (0, 0) and one maximum at (4, 0).

This problem has one minimum at (2, 3) and one maximum at (7, 1).

This problem has one minimum at (0, 7). This system is unbounded, so there is no maximum.

- Computer Concepts plans to build new computer chips with different materials, Type A and Type B. The Type A material weighs x grams. The Type B material weighs y grams. The maximum weight for the computer chips is 250 grams. Type A costs $150 per gram, while Type B costs $200 per gram. Local investors will invest no more than $45,000 in materials.
-
-
- Write and graph the system of inequalities to find the vertices.
-
Type A yields 600 mb of storage per gram, and Type B yields 750 mb of storage per gram.
- Determine the optimization equation for the amount of Type A and Type B material that Computer Concepts should build to maximize storage capacity.
- Find the optimized number of Type A and Type B material to provide the highest storage capacity for Computer Concepts.
- Computer Concepts should use 100 grams of Type A material and 150 grams of Type B material to have a maximum storage capacity of 172,500 mb.
Note
The final sentence in the problem provides the objective. Remember that you need to write this as “f (x, y) =”

- Friendship INC is creating a new set of rings for a special event. It takes x grams of silver and y grams of gold to make a ring. All rings have a combination of gold and silver. The “traditional” ring has twice as much gold as silver and weighs no more than 4 grams. The “contemporary” ring has twice as much silver as gold and weighs no more than 5 grams. The rings need a minimum of 0.5 grams of silver and a minimum of 0.5 grams of gold. Write and graph the system of inequalities to find the vertices.
The profit earned per gram of silver is $6 per gram and $8 per gram of gold.
How much of each type of metal should they use in their rings to optimize profit?
Friendship INC should use 2 grams of silver and 1 gram of gold to maximize profits.
