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