Upcoming SlideShare
×

# Alg II 3-4 Linear Programming

467 views

Published on

1 Like
Statistics
Notes
• Full Name
Comment goes here.

Are you sure you want to Yes No
• Be the first to comment

Views
Total views
467
On SlideShare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
5
0
Likes
1
Embeds 0
No embeds

No notes for slide

### Alg II 3-4 Linear Programming

1. 1. 3-4 LinearProgrammingAlgebra II Unit 3 Linear Systems© Tentinger
2. 2. 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
3. 3. 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.
4. 4. Linear Programming Businesses use linearprogramming to find out how tomaximize profit or minimizecosts. Most have constraints onwhat they can use or buy.
5. 5. Linear ProgrammingLinear programming is a process of findinga maximum or minimum of a function byusing coordinates of the polygon formedby the graph of the constraints.
6. 6. What is a constraint? A restriction... A boundary… A limitation…
7. 7. What is the feasible region?The feasible region is the area of thegraph in which all the constraints are met.
8. 8. 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
9. 9. 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
10. 10. 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
11. 11. 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.
12. 12. 8 1 ≤ x ≤5 7 6 5 4 3 y≥2 2y≤x+3 1 1 2 3 4 5
13. 13. 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
14. 14. Linear Programmingf(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
15. 15. Linear Programming•f(1, 4) = -5 minimum•f(5, 2) = 11 maximum
16. 16. Find the minimum and maximum value ofthe function f(x, y) = 4x + 3y We are given the constraints: • y ≥ -x + 2 1 •y ≤ x+2 4 • y ≥ 2x -5
17. 17. 6 y ≥ 2x -5 5 1 y x 2 4 4 3y ≥ -x + 2 2 1 1 2 3 4 5
18. 18. Verticesf(x, y) = 4x + 3y• f(0, 2) = 4(0) + 3(2) = 6• f(4, 3) = 4(4) + 3(3) = 25• f( 3 , - 3 ) = 4( 3) + 3(- 3 ) = 7 1 7 1 28 3 -1 = 25 3
19. 19. Linear Programming •f(0, 2) = 6 minimum •f(4, 3) = 25 maximum
20. 20. Example 1A 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 acresa day. The farmer has 275 acres available. If theprofit for soybeans is \$18 per acre and the profit forcotton is \$25 per acre, how many acres of each cropshould be planted to maximize profits?
21. 21. Step 1: Define the variables What are the unknown values?Let c = number of acres of cotton toplantLet s = number of acres of soybeans toplant
22. 22. Step 2: Write a System ofInequalitiesWrite the constraints. What are thelimitations given in the problem? The number of acres planted in cotton must c 0 be greater than or equal to 0. s 0 The number of acres planted in soybeans must be greater than or equal to 0. c s 275 The total number of acres planted must be less than or equal to 275. c s 25 The time available for planting must be less 9 12 than or equal to 25 days.
23. 23. Step 3: Graph theInequalities s c The purple area is the feasible region.
24. 24. Step 4: Name the Vertices of the Feasible Region of the vertices of theFind the coordinatesfeasible region, the area inside the polygon. (0,275) (225,0) (0,0) (75,200)
25. 25. Step 5: Write an Equation tobe Maximized orMinimized 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.
26. 26. Step 6: Substitute theCoordinates into theEquation the coordinates of the vertices into the Substitute maximum profit 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
27. 27. Step 7: Find the Maximum (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 225 acres of cotton and 0 acres of soybeans should be planted for a maximum profit of \$5,625.
28. 28. Example 2:The Bethlehem Steel Mill can convert steel intogirders and rods. The mill can produce at most100 units of steel a day. At least 20 girders andat least 60 rods are required daily by regularcustomers. If the profit on a girder is \$8 and theprofit on a rod is \$6, how many units of eachtype of steel should the mill produce each day tomaximize the profits?
29. 29. Step 1: Define the Variables Let x = number of girders Let y = number of rodsStep 2: Write a System of Inequalities x 20 At least 20 girders are required daily. y 60 At least 60 rods are required daily. The mill can produce at most 100 units x y 100 of steel a day.
30. 30. Step 3: Graph the Inequalitiesx 20, y 60, and x y 100 100 80 60 40 20The purple region represents the feasible region.-50 50 100
31. 31. Step 4: Name the Vertices of theFeasible Region Find the coordinates of the vertices of the feasible region, the area inside the polygon. (20, 60) (20, 80) (40, 60)
32. 32. Step 5: Write an Equation to be Maximized or Minimized p(x,y) = 8x + 6yMaximum profit = \$8 times the number ofgirders produced + \$6 times the number ofrods produced
33. 33. Step 6: Substitute the Coordinates into the EquationSubstitute the coordinates of the verticesinto 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
34. 34. Step 7: Find the Maximum (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 40 girders and 60 rods of steel should be produced for a maximum profit of \$680.
35. 35. Homework• Pg 160-161 #10-13, 16-19• 8 problems