Constraints Feasible region Bounded/ unbound Vertices

Slides:



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

2.7 Linear Programming.
3.4 Linear Programming.
3 – 4 Linear Programming Word Problems
3.4 Linear Programming 10/31/2008. Optimization: finding the solution that is either a minimum or maximum.
Lesson 3-3 Ideas/Vocabulary
S EPTEMBER 14, L INEAR P ROGRAMMING Linear programming = a process of maximizing a linear objective function Objective function = gives a quantity.
Linear Programming?!?! Sec Linear Programming In management science, it is often required to maximize or minimize a linear function called an objective.
Linear Programming Unit 2, Lesson 4 10/13.
Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem.
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.
Systems of Linear Equations and Inequalities (Chapter 3)
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
3.4 Linear Programming p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
P I can solve linear programing problem. Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
Solve problems by using linear programming.
Warm-Up Graph the following system of inequalities. Find the coordinates at each vertices.
Linear Programming Problem. Definition A linear programming problem is the problem of optimizing (maximizing or minimizing) a linear function (a function.
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
Class Schedule: Class Announcements Homework Questions 3.4 Notes Begin Homework.
Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.
3.4 – Linear Programming. Ex. 1 Graph the system of inequalities. Name the coordinates of the vertices of the feasible region. Find the max & min values.
3.4: Linear Programming Objectives: Students will be able to… Use linear inequalities to optimize the value of some quantity To solve linear programming.
Class Opener: Solve each equation for Y: 1.3x + y = y = 2x 3.x + 2y = 5 4. x – y = x + 3y = x – 5y = -3.
Warm-up Solve each system of equations:
Get out your Vertices Worksheet!
Chapter 2 Systems of Linear Equations and Inequalities.
Unit 1 Linear programming. Define: LINEAR PROGRAMMING – is a method for finding a minimum or maximum value of some quantity, given a set of constraints.
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.
(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-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.
1. What does a need to be if there were infinitely many solutions to the system of equations. y + 2x = 12 2y + 4x = 2a.
Section 3.5 Linear Programing In Two Variables. Optimization Example Soup Cans (Packaging) Maximize: Volume Minimize: Material Sales Profit Cost When.
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 A-CED.3 REPRESENT CONSTRAINTS BY EQUATIONS OR INEQUALITIES, AND BY SYSTEMS OF EQUATIONS AND/OR INEQUALITIES, AND INTERPRET SOLUTIONS.
HW: Pg #10-14, 15-21o 10. Min of -34 at (-2, -6); Max of 27 at (1, 5) 11. Min of 10 at (2, 1); No Max – feasible region is unbounded 12. Min of.
Linear Programming Chapter 3 Lesson 4 Vocabulary Constraints- Conditions given to variables, often expressed as linear inequalities. Feasible Region-
October 7: Systems of Equations Today you will review how to solve systems of equations by graphing and will learn how to classify the systems. - HW Review.
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
2-7 Linear Programming Pre Calc A.
Systems of Equations and Inequalities
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
9/8/16 In solving a system of equations, when will your answer be “no solution”? Identify the slope and y-intercept: 2
Systems of Equations/Inequalities
Splash Screen.
ALGEBRA II HONORS/GIFTED SECTION 3-4 : LINEAR PROGRAMMING
Linear Systems Chapter 3.
3.2 Linear Programming 3 Credits AS
3-3 Optimization with Linear Programming
Linear Programming.
3.4 – Linear Programming.
Optimization with Linear Programming
Solve the system of inequalities by graphing. x ≤ 2 y > 3
8.4 Linear Programming p
Graphing Systems of Linear Inequalities
MTH-5101 Practice Test (1) x ≥ 40 (2) y ≥ 0 (3) y ≤ 140
Linear Programming Example: Maximize x + y x and y are called
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Nature does nothing uselessly.
1.6 Linear Programming Pg. 30.
Linear Programming.
Presentation transcript:

Constraints Feasible region Bounded/ unbound Vertices 3.4 Linear Programming Constraints Feasible region Bounded/ unbound Vertices

Feasible Region The area on the graph where all the answers of the system are graphed. This a bounded region.

Unbound Region The area on the graph where all the answers of the system are graphed. This a unbounded region. It goes beyond the graph

Vertices of the region Vertices are the points where the lines meet. We need them for Linear Programming.

After we have found the vertices We place the x and y value a given function. We are trying to find the maximum or minimum of the function, written as f( x, y) =

The vertices come the system of equations called constraint. For this problem Given the constraints. Here we find where the equations intersect by elimination or substitution.

Finding the vertices given the constraints Take two the equations and find where they intersect. x ≤ 5 and y ≤ 4 would be (5, 4) x ≤ 5 and x + y ≥ 2, would be 5 + y ≥ 2 y = - 3 So the intersect is (5, - 3) y ≤ 4 and x + y ≥ 2. would be x + 4 ≥ 2 x = - 2 So its intersects is (- 2, 4)

Where is the feasible region?

Where is the feasible region?

To find the Maximum or Minimum we f( x, y) using the vertices f( x, y) = 3x – 2y ( -2, 4) = 3(- 2) – 2(4) = - 14 ( 5, 4) = 3(5) – 2(4) = 7 (5, - 3) = 3(5) – 2( - 3) = 21

To find the Maximum or Minimum we f( x, y) using the vertices f( x, y) = 3x – 2y ( -2, 4) = 3(- 2) – 2(4) = - 14 Min. of – 14 at ( - 2,4) ( 5, 4) = 3(5) – 2(4) = 7 (5, - 3) = 3(5) – 2( - 3) = 21 Max. of 21 at ( 5, - 3)

Key concept Step 1 Define the variables Step 2 Write a system of inequalities Step 3 Graph the system of inequalities Step 4 Find the coordinates of the vertices of the feasible region Step 5 Write a function to be maximized or minimized Step 6 Substitute the coordinates of the vertices into the function Step 7 Select the greatest or least result. Answer the problem

Key concept Step 1 Define the variables Step 2 Write a system of inequalities Step 3 Graph the system of inequalities Step 4 Find the coordinates of the vertices of the feasible region Step 5 Write a function to be maximized or minimized Step 6 Substitute the coordinates of the vertices into the function Step 7 Select the greatest or least result. Answer the problem

Key concept Step 1 Define the variables Step 2 Write a system of inequalities Step 3 Graph the system of inequalities Step 4 Find the coordinates of the vertices of the feasible region Step 5 Write a function to be maximized or minimized Step 6 Substitute the coordinates of the vertices into the function Step 7 Select the greatest or least result. Answer the problem

Key concept Step 1 Define the variables Step 2 Write a system of inequalities Step 3 Graph the system of inequalities Step 4 Find the coordinates of the vertices of the feasible region Step 5 Write a function to be maximized or minimized Step 6 Substitute the coordinates of the vertices into the function Step 7 Select the greatest or least result. Answer the problem

Key concept Step 1 Define the variables Step 2 Write a system of inequalities Step 3 Graph the system of inequalities Step 4 Find the coordinates of the vertices of the feasible region Step 5 Write a function to be maximized or minimized Step 6 Substitute the coordinates of the vertices into the function Step 7 Select the greatest or least result. Answer the problem

Key concept Step 1 Define the variables Step 2 Write a system of inequalities Step 3 Graph the system of inequalities Step 4 Find the coordinates of the vertices of the feasible region Step 5 Write a function to be maximized or minimized Step 6 Substitute the coordinates of the vertices into the function Step 7 Select the greatest or least result. Answer the problem

Key concept Step 1 Define the variables Step 2 Write a system of inequalities Step 3 Graph the system of inequalities Step 4 Find the coordinates of the vertices of the feasible region Step 5 Write a function to be maximized or minimized Step 6 Substitute the coordinates of the vertices into the function Step 7 Select the greatest or least result. Answer the problem

Find the maximum and minimum values of the functions f( x, y) = 2x + 3y Constraints -x + 2y ≤ 2 x – 2y ≤ 4 x + y ≥ - 2

Find the vertices -x + 2y ≤ 2 - x + 2y = 2 x – 2y ≤ 4 x – 2y = 4 0 = 0 Must not intersect x + y ≥ - 2 x + y = - 2 3y = 0 y = 0 x + 0 = - 2 Must intersect at ( - 2, 0)

x – 2y ≤ 4 x – 2y = 4 x – 2y = 4 x + y ≥ - 2 x + y = - 2 - x - y = 2 - 3y = 6 y = - 2 X + ( -2) = - 2 x = 0 (0, - 2) The vertices are ( - 2,0) and (0,- 2)

Off the Graph. No Max.

Find the maximum and minimum values of the functions f( x, y) = 2x + 3y f( - 2, 0) = 2( - 2) + 3(0) = - 4 f( 0, - 2) = 2( 0) + 3( - 2) = - 6 Minimum - 6 at (0, - 2)

Homework Page 132 – 133 # 15, 16, 21, 26, 27

Homework Page 132 – 133 # 17, 20, 22, 23, 25