Min:(0, 15) Max:(5, 0) NoA, D,GDTrueMaximumProfit =$605The feasibleregion iswhere all theshadingoverlaps.Quadrant1x > 0y > 0NoSolutionx + y <8x - y > 6A system ofinequalitiesinvolvesshadedregions.False(2, 0)and(12, 0)A, B,C, D25x +12y MaximizeIf a point isin thefeasibleregion, it is asolution.Ax + y < 50x < 24y < 40 5 pots40plates Step 1: Graph the lines Step 2: Test points tofind where to shade Step 3: Identify wherethe shaded regionsoverlap(-3,0) $480(2,6)Min:(0, 15) Max:(5, 0)NoA, D,GDTrueMaximumProfit =$605The feasibleregion iswhere all theshadingoverlaps.Quadrant1x > 0y > 0NoSolutionx + y <8x - y > 6A system ofinequalitiesinvolvesshadedregions.False(2, 0)and(12, 0)A, B,C, D25x +12y MaximizeIf a point isin thefeasibleregion, it is asolution.Ax + y < 50x < 24y < 40 5 pots40plates Step 1: Graph the lines Step 2: Test points tofind where to shade Step 3: Identify wherethe shaded regionsoverlap(-3,0) $480(2,6)

Algebra II Review - Call List

(Print) Use this randomly generated list as your call list when playing the game. There is no need to say the BINGO column name. Place some kind of mark (like an X, a checkmark, a dot, tally mark, etc) on each cell as you announce it, to keep track. You can also cut out each item, place them in a bag and pull words from the bag.


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
  1. Min: (0, 15)
  2. Max: (5, 0)
  3. No
  4. A, D, G
  5. D
  6. True
  7. Maximum Profit = $605
  8. The feasible region is where all the shading overlaps.
  9. Quadrant 1 x > 0 y > 0
  10. No Solution
  11. x + y < 8 x - y > 6
  12. A system of inequalities involves shaded regions.
  13. False
  14. (2, 0) and (12, 0)
  15. A, B, C, D
  16. 25x +12y Maximize
  17. If a point is in the feasible region, it is a solution.
  18. A
  19. x + y < 50 x < 24 y < 40
  20. 5 pots 40 plates
  21. Step 1: Graph the lines Step 2: Test points to find where to shade Step 3: Identify where the shaded regions overlap
  22. (-3, 0)
  23. $480
  24. (2, 6)