alg ii unit 3-4-linear programingintro
TRANSCRIPT
![Page 1: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/1.jpg)
3-4 Linear ProgrammingAlgebra II Unit 3 Linear Systems© Tentinger
![Page 2: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/2.jpg)
Essential Understanding and Objectives
●Essential Understanding: Some real-world problems involve multiple linear relationships. Linear programming accounts for all of these linear relationships and gives the solution to the problem.
●Objectives:●Students will be able to:
●Solving problems using linear programming●Define constraint, linear programming, feasible region, and objective function
![Page 3: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/3.jpg)
Iowa Core Curriculum• Algebra• A.CED.3 Represent constraints by equations or inequalities,
and by systems of equations and/or inequalities, and interpret solutions as viable or nonviable options in a modeling context. For example, represent inequalities describing nutritional and cost constraints on combinations of different foods.
![Page 4: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/4.jpg)
Linear Programming
Businesses use linear programming to find out how to maximize profit or minimize costs. Most have constraints on what they can use or buy.
![Page 5: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/5.jpg)
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 6: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/6.jpg)
What is a constraint?
A restriction...
A boundary…
A limitation…
![Page 7: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/7.jpg)
What is the feasible region?
The feasible region is the area of the graph in which all the constraints are met.
![Page 8: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/8.jpg)
Objective Function• The quantity you are trying to maximize or minimize is
modeled by this.• Usually this quantity is the cost or profit• Looks something like this C = ax + by, where a and b are real
numbers
![Page 9: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/9.jpg)
Vertex Principle• If there is a maximum or minimum value of the linear objective
function, it occurs at one or more vertices of the feasible region.
Online Example
![Page 10: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/10.jpg)
Find the minimum and maximumvalue of the function f(x, y) = 3x - 2y.
We are given the constraints:• y ≥ 2• 1 ≤ x ≤5 • y ≤ x + 3
![Page 11: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/11.jpg)
Linear Programming
•Find the minimum and maximum values by graphing the inequalities and finding the vertices of the polygon formed. •Substitute the vertices into the function and find the largest and smallest values.
![Page 12: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/12.jpg)
6
4
2
2 3 4
3
1
1
5
5
7
8
y ≤ x + 3
y ≥ 2
1 ≤ x ≤5
![Page 13: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/13.jpg)
Linear Programming
•The vertices of the quadrilateral formed are:
(1, 2) (1, 4) (5, 2) (5, 8) •Plug these points into the objective function f(x, y) = 3x - 2y
![Page 14: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/14.jpg)
Linear Programming
f(x, y) = 3x - 2y• f(1, 2) = 3(1) - 2(2) = 3 - 4 = -1 • f(1, 4) = 3(1) - 2(4) = 3 - 8 = -5• f(5, 2) = 3(5) - 2(2) = 15 - 4 = 11• f(5, 8) = 3(5) - 2(8) = 15 - 16 = -1
![Page 15: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/15.jpg)
Linear Programming
•f(1, 4) = -5 minimum•f(5, 2) = 11 maximum
![Page 16: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/16.jpg)
Find the minimum and maximum value of the function f(x, y) = 4x + 3y
We are given the constraints:• y ≥ -x + 2
• y ≤ x + 2
• y ≥ 2x -5
1
4
![Page 17: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/17.jpg)
6
4
2
53 4
5
1
1
2
3y ≥ -x + 2
y ≥ 2x -5
y x 1
24
![Page 18: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/18.jpg)
Vertices
f(x, y) = 4x + 3y• f(0, 2) = 4(0) + 3(2) = 6• f(4, 3) = 4(4) + 3(3) = 25
• f( , - ) = 4( ) + 3(- ) = -1 = 7
3
1
3
1
3
7
3
28
3
25
3
![Page 19: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/19.jpg)
Linear Programming
•f(0, 2) = 6 minimum•f(4, 3) = 25 maximum
![Page 20: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/20.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 21: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/21.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 22: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/22.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 23: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/23.jpg)
Step 3: Graph the Inequalities
c
s
The purple area is the feasible region.
![Page 24: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/24.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 25: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/25.jpg)
Step 5: Write an Equation to be Maximized or Minimizedp(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 26: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/26.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 27: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/27.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 28: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/28.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 29: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/29.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 30: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/30.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 31: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/31.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 32: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/32.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 33: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/33.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 34: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/34.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 35: Alg II Unit 3-4-linear programingintro](https://reader035.vdocument.in/reader035/viewer/2022062709/5591a1f71a28aba7268b4743/html5/thumbnails/35.jpg)
Homework• Pg 160-161
#10-13, 16, 17-19• 8 problems