Warm-up Follows….. 5-Minute Check 4 A.(0, 3), (0, 6), (2, 12) B.(0, 0), (0, 3), (0, 6), (2, 3) C.(0, 0), (0, 3), (2, 3), (3, 2) D.(0, 0), (0, 3), (2,

Slides:



Advertisements
Similar presentations
Solve the system of inequalities by graphing. x ≤ – 2 y > 3
Advertisements

Welcome to Interactive Chalkboard
3.4 Linear Programming.
3 – 4 Linear Programming Word Problems
Lesson 3-3 Ideas/Vocabulary
Splash Screen. Lesson Menu Five-Minute Check (over Lesson 3–1) CCSS Then/Now New Vocabulary Key Concept: Solving Systems of Inequalities Example 1: Intersecting.
Ch 2. 6 – Solving Systems of Linear Inequalities & Ch 2
Linear Programming Unit 2, Lesson 4 10/13.
3-5: Linear Programming.
Linear Programming Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Linear programming is a strategy for finding the.
Splash Screen. Lesson Menu Five-Minute Check (over Lesson 6–1) CCSS Then/Now New Vocabulary Key Concept: Solving by Substitution Example 1:Solve a System.
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Splash Screen. Lesson Menu Five-Minute Check (over Lesson 3–2) CCSS Then/Now New Vocabulary Key Concept: Feasible Regions Example 1: Bounded Region Example.
Splash Screen. Then/Now You solved systems of linear inequalities by graphing. Find the maximum and minimum values of a function over a region. Solve.
Warm - Up. Learning Targets  I can solve systems of inequalities by graphing.  I can determine the coordinates of the vertices of a region formed by.
Splash Screen.
Splash Screen. Lesson Menu Five-Minute Check (over Chapter 5) CCSS Then/Now New Vocabulary Concept Summary: Possible Solutions Example 1:Number of Solutions.
Graphing Linear Inequalities in Two Variables Chapter 4 – Section 1.
Splash Screen. Over Lesson 2–4 5-Minute Check 1 A.–4 B.–1 C.4 D.13 Solve 8y + 3 = 5y + 15.
Splash Screen. Lesson Menu Five-Minute Check (over Lesson 2–7) CCSS Then/Now New Vocabulary Example 1:Dashed Boundary Example 2:Real-World Example: Solid.
Linear Programming Problem. Definition A linear programming problem is the problem of optimizing (maximizing or minimizing) a linear function (a function.
Class Schedule: Class Announcements Homework Questions 3.4 Notes Begin Homework.
Splash Screen. Lesson Menu Five-Minute Check (over Lesson 2–7) CCSS Then/Now New Vocabulary Example 1:Dashed Boundary Example 2:Real-World Example: Solid.
Get out your Vertices Worksheet!
Welcome to Interactive Chalkboard Algebra 2 Interactive Chalkboard Copyright © by The McGraw-Hill Companies, Inc. Send all inquiries to: GLENCOE DIVISION.
Lesson Menu Five-Minute Check (over Lesson 3–6) CCSS Then/Now New Vocabulary Key Concept: Second-Order Determinant Example 1: Second-Order Determinant.
Lesson Menu Five-Minute Check (over Lesson 3–1) CCSS Then/Now New Vocabulary Key Concept: Solving Systems of Inequalities Example 1: Intersecting Regions.
Constraints Feasible region Bounded/ unbound Vertices
Chapter 4: Systems of Equations and Inequalities Section 4.7: Solving Linear Systems of Inequalities.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Lesson Menu Five-Minute Check (over Lesson 3–7) CCSS Then/Now New Vocabulary Key Concept: Identity Matrix for Multiplication Example 1: Verify Inverse.
Splash Screen. Lesson Menu Five-Minute Check (over Chapter 5) CCSS Then/Now New Vocabulary Concept Summary: Possible Solutions Example 1:Number of Solutions.
3-4: Linear Programming Objectives: Standards addressed:
3-5: Linear Programming. Learning Target I can solve linear programing problem.
3.4 Linear Programming Objective:
3.3 Linear Programming. Vocabulary Constraints: linear inequalities; boundary lines Objective Function: Equation in standard form used to determine the.
Splash Screen. Lesson Menu Five-Minute Check (over Lesson 3–2) CCSS Then/Now New Vocabulary Key Concept: Feasible Regions Example 1: Bounded Region Example.
Chapter 3 Section 4 Linear Programming Algebra 2 January 29, 2009.
LINEAR PROGRAMMING A-CED.3 REPRESENT CONSTRAINTS BY EQUATIONS OR INEQUALITIES, AND BY SYSTEMS OF EQUATIONS AND/OR INEQUALITIES, AND INTERPRET SOLUTIONS.
Content Standards A.CED.3 Represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret solutions.
Linear Programming Chapter 3 Lesson 4 Vocabulary Constraints- Conditions given to variables, often expressed as linear inequalities. Feasible Region-
Have out to be checked: P. 338/10-15, 17, 19, 23
Splash Screen.
Splash Screen.
Splash Screen.
Splash Screen.
Welcome to Interactive Chalkboard
2.7 Linear Programming Objectives: Use linear programming procedures to solve applications. Recognize situations where exactly one solution to a linear.
Optimization with Linear Programming
Splash Screen.
Digital Lesson Linear Programming.
Five-Minute Check (over Lesson 1–4) Mathematical Practices Then/Now
Systems of Equations and Inequalities
Five-Minute Check (over Lesson 1–6) Mathematical Practices Then/Now
Digital Lesson Linear Programming.
Splash Screen.
Splash Screen.
Splash Screen.
Splash Screen.
Solve a system of linear equation in two variables
3-3 Optimization with Linear Programming
Linear Programming.
Splash Screen.
Optimization with Linear Programming
Solve the system of inequalities by graphing. x ≤ 2 y > 3
Splash Screen.
Splash Screen.
Splash Screen.
Splash Screen.
1.6 Linear Programming Pg. 30.
Presentation transcript:

Warm-up Follows….

5-Minute Check 4 A.(0, 3), (0, 6), (2, 12) B.(0, 0), (0, 3), (0, 6), (2, 3) C.(0, 0), (0, 3), (2, 3), (3, 2) D.(0, 0), (0, 3), (2, 3), (4, 0) Find the coordinates of the vertices of the figure formed by the system of inequalities. y ≤ 3 y ≥ 0 x ≥ 0 2y + 3x ≤ 12

5-Minute Check 5 A.(2, 2) B.(4, 2) C.(3, 0) D.(3, 4) Which point is not a solution of the system of inequalities y ≤ 4 and y > |x – 3|?

Chapter 3 Lesson 3 ( Part 2) Optimization with Linear Programming

CCSS Content Standards 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. Mathematical Practices 4 Model with mathematics. 8 Look for and express regularity in repeated reasoning.

Then/Now You solved systems of linear inequalities by graphing. Find the maximum and minimum values of a function over a region. Solve real-world optimization problems using linear programming.

Vocabulary linear programming feasible region bounded unbounded optimize

Concept

Example 3 Optimization with Linear Programming LANDSCAPING A landscaping company has crews who mow lawns and prune shrubbery. The company schedules 1 hour for mowing jobs and 3 hours for pruning jobs. Each crew is scheduled for no more than 2 pruning jobs per day. Each crew’s schedule is set up for a maximum of 9 hours per day. On the average, the charge for mowing a lawn is $40 and the charge for pruning shrubbery is $120. Find a combination of mowing lawns and pruning shrubs that will maximize the income the company receives per day from one of its crews.

Example 3 Optimization with Linear Programming Step 1Define the variables. m = the number of mowing jobs p = the number of pruning jobs

Example 3 Optimization with Linear Programming Step 2Write a system of inequalities. Since the number of jobs cannot be negative, m and p must be nonnegative numbers. m ≥ 0, p ≥ 0 Mowing jobs take 1 hour. Pruning jobs take 3 hours. There are 9 hours to do the jobs. 1m + 3p ≤ 9 There are no more than 2 pruning jobs a day. p ≤ 2

Example 3 Optimization with Linear Programming Step 3Graph the system of inequalities.

Example 3 Optimization with Linear Programming Step 4Find the coordinates of the vertices of the feasible region. From the graph, the vertices are at (0, 2), (3, 2), (9, 0), and (0, 0). Step 5Write the function to be maximized. The function that describes the income is f(m, p) = 40m + 120p. We want to find the maximum value for this function.

Example 3 Optimization with Linear Programming Step 6Substitute the coordinates of the vertices into the function. Step 7Select the greatest amount.

Example 3 Optimization with Linear Programming Answer:The maximum values are 360 at (3, 2) and 360 at (9, 0). This means that the company receives the most money with 3 mowings and 2 prunings or 9 mowings and 0 prunings.

Example 3 LANDSCAPING A landscaping company has crews who rake leaves and mulch. The company schedules 2 hours for mulching jobs and 4 hours for raking jobs. Each crew is scheduled for no more than 2 raking jobs per day. Each crew’s schedule is set up for a maximum of 8 hours per day. On the average, the charge for raking a lawn is $50 and the charge for mulching is $30.

Example 3 What is a combination of raking leaves and mulching that will maximize the income the company receives per day from one of its crews? A.0 mulching; 2 raking B.4 mulching; 0 raking C.0 mulching; 4 raking D.2 mulching; 0 raking

Homework (Part 2) Page 158: 14, 16, 24, 26, 28, 30