3-6: linear programming linear programming is a process of finding a maximum or minimum of a...
TRANSCRIPT
![Page 1: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/1.jpg)
3-6: Linear Programming
Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the graph of the constraints.
![Page 2: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/2.jpg)
What is a constraint?
A restriction...
A boundary…
A limitation…
![Page 3: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/3.jpg)
What is the feasible region?
The feasible region is the area of the graph in which all the constraints are met.
![Page 4: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/4.jpg)
A farmer has 25 days to plant cotton and soybeans. The cotton can be planted at a rate of 9 acres per day, and the soybeans can be planted at a rate of 12 acres a day. The farmer has 275 acres available. If the profit for soybeans is $18 per acre and the profit for cotton is $25 per acre, how many acres of each crop should be planted to maximize profits?
Example 1
![Page 5: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/5.jpg)
Step 1: Define the variables
What are the unknown values?
Let c = number of acres of cotton to plant
Let s = number of acres of soybeans to plant
![Page 6: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/6.jpg)
Write the constraints. What are the limitations given in the problem?
0c
The total number of acres planted must be less than or equal to 275.
The time available for planting must be less than or equal to 25 days.
The number of acres planted in cotton must be greater than or equal to 0.
The number of acres planted in soybeans must be greater than or equal to 0.
s0
275c s
259 12
c s
Step 2: Write a System of Inequalities
![Page 7: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/7.jpg)
Step 3: Graph the Inequalities
c
s
The purple area is the feasible region.
![Page 8: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/8.jpg)
Step 4: Name the Vertices of the Feasible Region
(0,275)
(225,0)
(0,0)
(75,200)
Find the coordinates of the vertices of the feasible region, the area inside the polygon.
![Page 9: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/9.jpg)
Step 5: Write an Equation to be Maximized or Minimized
p(c,s) = 25c + 18s
Maximum profit = $25 times the number of acres of cotton planted + $18 times the number of acres of soybeans planted.
![Page 10: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/10.jpg)
Step 6: Substitute the Coordinates into the Equation
(c,s) 25c + 18s f(c,s) (0,275) 25(0) + 18(275) 4950 (225,0) 25(225) + 18(0) 5625 (0,0) 25(0) + 18(0) 0 (75,200) 25(75) + 18(200) 5475
Substitute the coordinates of the vertices into the maximum profit equation.
![Page 11: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/11.jpg)
Step 7: Find the Maximum
225 acres of cotton and 0 acres of soybeans should be planted for a maximum profit of $5,625.
(c,s) 25c + 18s f(c,s)
(0,275) 25(0) + 18(275) 4950
(225,0) 25(225) + 18(0) 5625
(0,0) 25(0) + 18(0) 0
(75,200) 25(75) + 18(200) 5475
![Page 12: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/12.jpg)
Example 2:
The Bethlehem Steel Mill can convert steel into girders and rods. The mill can produce at most 100 units of steel a day. At least 20 girders and at least 60 rods are required daily by regular customers. If the profit on a girder is $8 and the profit on a rod is $6, how many units of each type of steel should the mill produce each day to maximize the profits?
![Page 13: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/13.jpg)
Step 1: Define the Variables
Let x = number of girders
Let y = number of rods
Step 2: Write a System of Inequalities
60y
100x y
20x At least 20 girders are required daily.
At least 60 rods are required daily.
The mill can produce at most 100 units of steel a day.
![Page 14: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/14.jpg)
150
100
50
-50
-100
-200 -100 100 200
Step 3: Graph the Inequalities
x 20
![Page 15: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/15.jpg)
300
250
200
150
100
50
100 200 300 400 500
Step 3: Graph the Inequalities
20 60 and x y
![Page 16: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/16.jpg)
100
80
60
40
20
-50 50 100
Step 3: Graph the Inequalities20, 60, 100and x y x y
The purple region represents the feasible region.
![Page 17: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/17.jpg)
Step 4: Name the Vertices of the Feasible Region
Find the coordinates of the vertices of the feasible region, the area inside the polygon.
(20, 60)
(20, 80)
(40, 60)
![Page 18: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/18.jpg)
Step 5: Write an Equation to be Maximized or Minimized
p(x,y) = 8x + 6y
Maximum profit = $8 times the number of girders produced + $6 times the number of rods produced
![Page 19: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/19.jpg)
Step 6: Substitute the Coordinates into the Equation
Substitute the coordinates of the vertices
into the maximum profit equation.
(x,y) 8x + 6y p(x,y) (20, 60) 8(20) + 6(60) 520 (20, 80) 8(20) + 6(80) 640 (40, 60) 8(40) + 6(60) 680
![Page 20: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/20.jpg)
Step 7: Find the Maximum
40 girders and 60 rods of steel should be produced for a maximum profit of $680.
(x,y) 8x + 6y p(x,y) (20, 60) 8(20) + 6(60) 520 (20, 80) 8(20) + 6(80) 640 (40, 60) 8(40) + 6(60) 680
![Page 21: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/21.jpg)
Explore…
1. Suppose the mill produces 150 units of steel a day, how does this change the feasible
region?
2. Can the mill increase profits with the new feasible region?
![Page 22: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/22.jpg)
Try these:
1) A theater, at which a drug abuse program is being presented, seats 150 people. The proceeds will be donated to a local drug information center. Admission is $2 for adults and $1 for students. Every two adults must bring at least one student. How many adults and students should attend in order to raise the maximum amount of money?
![Page 23: 3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the](https://reader035.vdocument.in/reader035/viewer/2022070414/5697c0101a28abf838ccb00e/html5/thumbnails/23.jpg)
2) The available parking area of a parking lot is 600 square meters. A car requires 6 square meters of space and a bus requires 30 square meters of space. The attendant can handle no more than 60 vehicles. If a car is charged $3.00 to park and a bus is charged $8.00, how many of each should the attendant accept to maximize income?