How Can I organize possibilities
description
Transcript of How Can I organize possibilities
![Page 1: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/1.jpg)
HOW CAN I ORGANIZE
POSSIBILITIES
Sec 5.2.2; page 241
![Page 2: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/2.jpg)
PAGE 241
Please read problem 5-75
![Page 3: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/3.jpg)
5-75
The Toy Factory
Otto Toyom builds toy cars and trucks. To make each car, he needs 4 wheels, 2 seats, and 1 gas tank. To make each truck, he needs 6 wheels, 1 seat, and 3 gas tanks. His storeroom has 36 wheels, 14 seats, and 15 gas tanks. He is trying to decide how many cars and trucks to build so he can make the largest possible amount of money when he sells them. Help Otto figure out what his options are. Where all of the choices he could make about how many cars and how many trucks he will build? Make a list of all possible combinations. Then plot the number of possible cars and trucks in the first quadrant of a graph.
![Page 4: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/4.jpg)
SUMMARY TABLE
Wheels
Seats Gas tanks
Cars
Trucks
Total
![Page 5: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/5.jpg)
SUMMARY TABLE
Wheels Seats Gas tanks
Cars 4 2 1
Trucks 6 1 3
Total 36 14 15
![Page 6: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/6.jpg)
IDENTIFY VARIABLES
Let x = number of cars Otto Toyom produces.Let y= number of trucks Otto Toyom produces.Use the first column of your table to write an inequality.4x+6y<36Now write two more inequalities using other columns.
![Page 7: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/7.jpg)
5 SETS OF INEQUALITIES
4x+6y<36
2x+y< 14
x+3y< 15
The last two are implied:
x
y
![Page 8: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/8.jpg)
GRAPH ALL 5 ON THE SAME GRID
f(x)=(-4/6)x+6f(x)=-2x+14f(x)=(-1/3)x+5
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19-1
12345678910111213141516171819
x
y
![Page 9: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/9.jpg)
GRAPH ALL 5 ON THE SAME GRID
Feasible region
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19-1
12345678910111213141516171819
x
y
![Page 10: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/10.jpg)
LOCATE AND LABEL ALL POINTS OF INTERSECTION.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19-1
12345678910111213141516171819
x
y
(0,0)(0,5)(3,4)(6,2)(7,0)
These points along with all the points in the feasible region will satisfy all inequalities.
![Page 11: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/11.jpg)
CHOOSE A POINT IN THE SHADED REGION
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19-1
12345678910111213141516171819
x
y
(0,5)(3,4)(6,2)(7,0)
Let’s say point (2,3)Check to see if this point satisfies all the constraints (inequalities)
![Page 12: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/12.jpg)
POINT (2,3)
What does each coordinate of the point represent?
Does the combination of 2 cars and 3 trucks satisfy all the constraints? I.e. is (2,3) a solution on all equations you graphed?
Try other point s that are in the feasible (shaded) region.
![Page 13: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/13.jpg)
5-76
Otto wants to make as much profit as possible. Use your list to find which combination of cars and trucks will make the most profit based on the information below.
![Page 14: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/14.jpg)
5-76A. Which of Otto’s options fives him the greatest profit if he makes $1 on each truck he sells? How do you know?
B. The market has just changed, and Otto can now make $2 for each truck but only $1 for each car. What is his best choice for the number of cars and the number of trucks to make now? How can you be sure? Explain.
![Page 15: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/15.jpg)
5-77
In problem 5-76, you probably had to show many calculations to convince Otto that your recommendation was a good one. Now you will take another look at Otto’s business using algebra and graphing tools.
![Page 16: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/16.jpg)
5-77A
Write 3 inequalities to represent the relationship between the number of cars (x), and the number of trucks (y), and the number of:
![Page 17: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/17.jpg)
5-77
B. Graph this system of inequalities on the same set of axes you used you used for problem 5-75. Shade the solution lightly. Why is it okay to assume that
![Page 18: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/18.jpg)
5-77
C. What are the vertices of the pentagon that outlines your region? Explain how you could find the exact coordinates of those points if you could not read them easily from the graph.
![Page 19: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/19.jpg)
5-77
D. Are there any points in the solution region that represent choices that seem more likely to give Otto the maximum profit? Where are they? Why do you think they show the best choices?
![Page 20: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/20.jpg)
5-77
E. Write an equation to represent Otto’s total profit (p) if he makes $1 on each car and $2 on each truck. What if Otto ended up with a profit of only $8? Show how to use the graph of the profit equation when p=8 to figure out how many cars and trucks he made.
![Page 21: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/21.jpg)
5-77
F. Which points do you need to test in the profit equation to get the maximum profit? Is it necessary to try all of the points? Why or why not?
![Page 22: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/22.jpg)
G. What if Otto got greedy and wanted to make a profit of $14? How could you use the profit line to show Otto that his would be impossible based on his current pricing.
![Page 23: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/23.jpg)
5-78
Find Otto’s highest possible profit if he gets $3 per car and $2 per truck. Find the profit expression and fin the best combinations of cars and rucks to maximize the profit.
![Page 24: How Can I organize possibilities](https://reader033.fdocuments.us/reader033/viewer/2022061502/56816689550346895dda430a/html5/thumbnails/24.jpg)
ON YOUR OWN:Review your notes. Rewrite and fortify them if needed.Update your vocab list, if needed.
• Review and Preview
Page 243#79-86