# Acme Gem Co by yurtgc548

VIEWS: 2 PAGES: 8

• pg 1
```									Acme Gem Co.

Making Gems for all Occasions
The Problem…
The Acme Gem Co. makes two types of
artificial gems – a red stone and a blue
stone. Each blue stone requires 1 minute
at the cutting machine and 3 minutes at
the polishing machine. A red stone takes 2
minutes at the cutting machine and 2
minutes at the polishing machine. The
cutting machine is available for a maximum
of 100 minutes per day, and the polishing
machine is available a maximum 180
minutes per day.
To do…
 List the important information from
the problem
 Create a list of 20 possible
combinations of gems that fit the
criteria for the cutting machine
 Create a list of 20 impossible
combinations of gems that fit the
criteria for the cutting machine
More to do…
 On graph paper, draw a set of axes. Each
axis must show values from zero to 100.
The x-axis will represent the number of
blue stones, and the y-axis will represent
the number of red stones.
 Place a dot on your graph to represent all
of the POSSIBLE combinations to satisfy
the criteria for the cutting machine
And again…
 Create a list of 20 possible combinations of
gems that fit the criteria for the polishing
machine
 Create a list of 20 impossible combinations
of gems that fit the criteria for the
polishing machine
 Place a star on your graph to represent all
of the possible combinations to satisfy the
criteria for the cutting machine
And last..
 List 5 combinations of gems that fit
the following criteria:
 Fit the constraints   for BOTH machines
 Fits the constraint   for ONLY the polishing
machine
 Fits the constraint   for ONLY the cutting
machine
 Fits the constraint   for NEITHER machine
In Conclusion
1. Write an inequality to represent the
limitations on the polishing
machine.
2. Write an inequality to represent the
limitations on the cutting machine.
3. How does the graph of an inequation
differ from the graph of an equation?
To Submit
 Staple together the work of each
group member and pass in as one
work packet.

```
To top