The feasibleregion iswhere all theshadingoverlaps. A, B,C, Dx + y < 50x < 24y < 40 Step 1: Graph the lines Step 2: Test points tofind where to shade Step 3: Identify wherethe shaded regionsoverlap25x +12y MaximizeTrue(2, 0)and(12, 0)x + y <8x - y > 6AFalseA, D,G(-3,0) 5 pots40plates Max:(5, 0)(2,6)$480If a point isin thefeasibleregion, it is asolution.A system ofinequalitiesinvolvesshadedregions.NoMin:(0, 15) Quadrant1x > 0y > 0DNoSolutionMaximumProfit =$605The feasibleregion iswhere all theshadingoverlaps.A, B,C, Dx + y < 50x < 24y < 40 Step 1: Graph the lines Step 2: Test points tofind where to shade Step 3: Identify wherethe shaded regionsoverlap25x +12y MaximizeTrue(2, 0)and(12, 0)x + y <8x - y > 6AFalseA, D,G(-3,0) 5 pots40plates Max:(5, 0)(2,6)$480If a point isin thefeasibleregion, it is asolution.A system ofinequalitiesinvolvesshadedregions.NoMin:(0, 15) Quadrant1x > 0y > 0DNoSolutionMaximumProfit =$605

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