NAME ______________________________________________ DATE______________________________ PERIOD ______________
Extra Practice
Optimization with Linear Programming
Example 1
Graph the system of inequalities. Name the coordinates of the vertices of the
feasible region. Find the maximum and minimum values of the function for
this region.
1. x ≥ –2 2. y ≥ –4 3. x – y ≥ –2
–2 ≤ y ≤ 2 y ≥ –2x – 4 2y ≤ –x + 1
y + 2x ≤ 6 x ≤ –y y ≥ –1
f(x, y) = 4x + y f(x, y) = x + 2y f(x, y) = 2x + y
4. x ≤ 3 5. y ≤ 4 6. x ≥ –3
x≥y x≤y 2y ≤ –x + 3
y ≥ –1 y ≤ 2x + 2 y≥x
f(x, y) = x – 2y f(x, y) = 3x – y f(x, y) = 2x + y
Optimization with Linear Programming Extra Practice
NAME ______________________________________________ DATE______________________________ PERIOD ______________
Example 2
Graph the system of inequalities. Name the coordinates of the vertices of the
feasible region. Find the maximum and minimum values of the function for
this region.
7. x ≥ 2y – 4 8. x – 3y ≤ 2 9. y ≥ –2
1 3y ≤ x + 5 x ≤ –y
y ≤ – x
2 –y ≥ x – 3 x ≥ –2y – 5
x ≥ –4 f(x, y) = x + 3y f(x, y) = 2x –3y
f(x, y) = 3x – y
10. x ≥ y – 3 11. y ≥ –2x – 3 12. y ≤ 2x
–y + 1 ≤ x 2x ≤ y + 3 x+y≤2
4 ≥ y ≥ –2 x≤2 y ≤ –2
f(x, y) = –3x + 2y f(x, y) = x + y f(x, y) = 3x + 4y
Optimization with Linear Programming Extra Practice
NAME ______________________________________________ DATE______________________________ PERIOD ______________
Example 3
13. TRAIL MIX Oki and Stephen are making bags of trail mix to sell. Oki’s trail-mix
recipe requires 3 cups of nuts and 3 cups of dried fruit per bag. Stephen’s
trail-mix recipe requires 4 cup of nuts and 2 cups of dried fruit per bag.
Together, they want to make as many bags of trail mix as possible. They have
exactly 120 cups of nuts and 90 cups of dried fruit. Find the maximum number
of bags of trail mix Oki and Stephen can make together.
a. Define the variables, and write a system of inequalities.
b. Graph the system of inequalities, and find the coordinates of the vertices
of the feasible region.
c. Find the maximum number of bags of trail mix Oki and Stephen can
make. How many of each type of recipe should they make to maximize
the total number of bags?
14. FLOWERS A florist plans to make flower bouquets. Each bouquet should
have no more than 5 white roses and between 2 and 6 red roses. For every
bouquet, the number of red roses is 1 fewer than the number of white
roses. Each white rose costs $0.80, and each red rose costs $0.70. The florist
wants to find the minimum cost to make a bouquet and the combination of
white and red roses that costs the least to make.
a. Define the variables, and write a system of inequalities. Then write an
equation for the cost C of each bouquet.
Optimization with Linear Programming Extra Practice
NAME ______________________________________________ DATE______________________________ PERIOD ______________
b. Graph the system of inequalities, and find the coordinates of the vertices
of the feasible region.
c. Find the minimum cost for making a bouquet and the number of white
and red roses that should be in that bouquet.
15. EXERCISE Andrés is planning his exercise routine for the next month. He plans
to exercise by either bicycling for 1 hour or walking for 1 hour. He wants to
bicycle between 10 and 30 times and go on a walk no more than 25 times. He
also wants to bicycle at least twice as many times as he goes on a walk. Bicycling
uses 410 calories per hour of energy, and walking uses 300 calories per hour of
energy. Determine the number of times Andrés should bicycle and the number
of times he should walk over the next 30 days to maximize the number of
calories he used during exercising.
a. Define the variables, and write a system of inequalities. Then write an
equation for the number of calories C.
b. Graph the system of inequalities, and find the coordinates of the vertices
of the feasible region.
c. Find the number of times Andrés should bicycle and the number and
times he should walk to use the maximum number of calories. How
many calories will he use during exercise at this maximum number?
Optimization with Linear Programming Extra Practice
