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

Slides:



Advertisements
Similar presentations
3.4 Linear Programming.
Advertisements

3.4 Linear Programming 10/31/2008. Optimization: finding the solution that is either a minimum or maximum.
Lesson 3-3 Ideas/Vocabulary
30S Applied Math Mr. Knight – Killarney School Slide 1 Unit: Linear Programming Lesson 5: Problem Solving Problem Solving with Linear Programming Learning.
Unit 1 Solving Linear Systems by Graphing
5.4 Functions and Their Inverses CC.9-12.F.BF.1c (+) Compose functions. CC.9-12.A.CED.2 Create equations in two or more variables to represent relationships.
3-3 Solving Systems of Inequalities by Graphing
Solving Addition and Subtraction Inequalities
Splash Screen Inequalities Involving Absolute Values Lesson5-5.
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.
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.
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,
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.
Algebra 1 Notes Lesson 7-2 Substitution. Mathematics Standards -Patterns, Functions and Algebra: Solve real- world problems that can be modeled using.
Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities.
Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities.
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 p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
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.
Class Opener: Solve each equation for Y: 1.3x + y = y = 2x 3.x + 2y = 5 4. x – y = x + 3y = x – 5y = -3.
Get out your Vertices Worksheet!
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.
Splash Screen. Lesson Menu Five-Minute Check (over Chapter 5) CCSS Then/Now New Vocabulary Concept Summary: Possible Solutions Example 1:Number of Solutions.
(0, 0) (36, 0) (30, 4) (0, 10) WARM UP: a. Graph the system of inequalities. b. What are the vertices of the solution? Write your answers as ordered pairs.
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.
Linear Programming Chapter 3 Lesson 4 Vocabulary Constraints- Conditions given to variables, often expressed as linear inequalities. Feasible Region-
Splash Screen.
Splash Screen.
Splash Screen.
Optimization with Linear Programming
Splash Screen.
Systems of Equations and Inequalities
Five-Minute Check (over Lesson 1–6) Mathematical Practices Then/Now
Splash Screen.
Splash Screen.
Splash Screen.
Splash Screen.
Splash Screen.
Splash Screen.
Solve a system of linear equation in two variables
3.2 Linear Programming 3 Credits AS
Chapter 5 Linear Inequalities and Linear Programming
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
8.4 Linear Programming p
Warm Up Solve for x:
Splash Screen.
Objectives Identify solutions of linear equations in two variables.
Splash Screen.
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Splash Screen.
Solving Systems of Equations & Inequalities
Section Linear Programming
1.6 Linear Programming Pg. 30.
Presentation transcript:

Solve the system of inequalities by graphing. x ≤ – 2 y > 3 A. B. C. D. 5-Minute Check 1

Solve the system of inequalities by graphing. y ≤ 3x + 2 y > –x A. B. C. D. 5-Minute Check 2

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

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

Mathematical Practices 4 Model with mathematics. 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. CCSS

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. Then/Now

linear programming feasible region bounded unbounded optimize Vocabulary

Concept

Step 1 Graph the inequalities. Bounded Region Graph the following system of inequalities. Name the coordinates of the vertices of the feasible region. Find the maximum and minimum values of the function f(x, y) = 3x – 2y for this region. x ≤ 5 y ≤ 4 x + y ≥ 2 Step 1 Graph the inequalities. The polygon formed is a triangle with vertices at (–2, 4), (5, –3), and (5, 4). Example 1

Bounded Region Step 2 Use a table to find the maximum and minimum values of f(x, y). Substitute the coordinates of the vertices into the function. ← minimum ← maximum Answer: The vertices of the feasible region are (–2, 4), (5, –3), and (5, 4). The maximum value is 21 at (5, –3). The minimum value is –14 at (–2, 4). Example 1

A. maximum: f(4, 5) = 5 minimum: f(1, 5) = –11 Graph the following system of inequalities. What are the maximum and minimum values of the function f(x, y) = 4x – 3y for the feasible region of the graph? x ≤ 4 y ≤ 5 x + y ≥ 6 A. maximum: f(4, 5) = 5 minimum: f(1, 5) = –11 B. maximum: f(4, 2) = 10 minimum: f(1, 5) = –11 C. maximum: f(4, 2) = 10 minimum: f(4, 5) = 5 D. maximum: f(1, 5) = –11 minimum: f(4, 2) = 10 Example 1

Unbounded Region Graph the following system of inequalities. Name the coordinates of the vertices of the feasible region. Find the maximum and minimum values of the function f(x, y) = 2x + 3y for this region. –x + 2y ≤ 2 x – 2y ≤ 4 x + y ≥ –2 Graph the system of inequalities. There are only two points of intersection, (–2, 0) and (0, –2). Example 2

Unbounded Region The minimum value is –6 at (0, –2). Although f(–2, 0) is –4, it is not the maximum value since there are other points that produce greater values. For example, f(2,1) is 7 and f(3, 1) is 9. It appears that because the region is unbounded, f(x, y) has no maximum value. Answer: The vertices are at (–2, 0) and (0, –2). There is no maximum value. The minimum value is –6 at (0, –2). Example 2

A. maximum: no maximum minimum: f(6, 0) = 6 Graph the following system of inequalities. What are the maximum and minimum values of the function f(x, y) = x + 2y for the feasible region of the graph? x + 3y ≤ 6 –x – 3y ≤ 9 2y – x ≥ –6 A. maximum: no maximum minimum: f(6, 0) = 6 B. maximum: f(6, 0) = 6 minimum: f(0, –3) = –6 C. maximum: f(6, 0) = 6 minimum: no minimum D. maximum: no maximum minimum: f(0, –3) = –6 Example 2

Homework (Part 1): Pg 157: 2-12 even