Warm Up Graph the following inequalities 1) Y > 3x – 2 2) 5y + 4x < 20.

Slides:



Advertisements
Similar presentations
Linear Programming. Businesses use linear programming to find out how to maximize profit or minimize costs. Most have constraints on what they can use.
Advertisements

3.4 Linear Programming.
Linear Programming 1.6 (M3) p. 30 Test Friday !!.
Example 1 Define the Variables: Let l = length of package g = girth of package Two variables – two inequalities: Graph each inequality. Don’t forget to.
Linear Programming Unit 2, Lesson 4 10/13.
SECTION 3.4 Systems of Linear Inequalities. Warm Up 1.Graph y < -x +12. Graph the system.
Solve linear programming problems. Objective linear programming constraint feasible region objective function Vocabulary.
Determine if the given ordered pair is a solution of
Linear Programming A Summary. What??  Linear Programming is an algebraic strategy used to find optimal solutions. –Uses linear inequalities called constraints.
3.3 Systems of Linear Inequalities -graphing -linear programming
3.5 Linear Programming Objectives: Write and graph a set of constraints for a linear-programming problem. Use linear programming.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
2-3: Linear Programming Unit 2: Linear Functions English Casbarro.
Linear Programming Advanced Math Topics Mrs. Mongold.
Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.
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!
Linear Programming. Graph the following system of inequalities.
3-6: 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.
Constraints Feasible region Bounded/ unbound Vertices
Linear Programming. Example x:x:Number of cars built Define the Variables Does it matter? y:y:Number of trucks built.
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.
3.4 Linear Programming Solve linear programming problems in two variables using graphical methods.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
 Optimizing a function of x and y consists in finding the vertex of a polygon of constraints which, depending on the situation, maximizes or minimizes.
Warm Up Graph the following system of inequalities Y > 3x – 2 5y + 4x < 20.
Warm Up Is (4,2) a solution to the system Y > 3x – 2 5y + 4x < 20.
SYSTEMS OF EQUATIONS. Unit 2 Systems of Equations A system of equations is two or more equations with the same variables. ex. 3x-2y=8 4x+3y=12 There are.
3-4: Linear Programming Objectives: Standards addressed:
3-5: Linear Programming. Learning Target I can solve linear programing problem.
Linear Programming. What is linear programming? Use a system of constraints (inequalities) to find the vertices of the feasible region (overlapping shaded.
3.3 Linear Programming. Vocabulary Constraints: linear inequalities; boundary lines Objective Function: Equation in standard form used to determine the.
Chapter 3 Section 4 Linear Programming Algebra 2 January 29, 2009.
1. Solve this system and find the product of its solutions. x + y = 7 2x – y =8 2. The feasible region for a set of constraints has vertices (2,0), (8,2)
1. What does a need to be if there were infinitely many solutions to the system of equations. y + 2x = 12 2y + 4x = 2a.
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-
SYSTEMS OF EQUATIONS.
October 18 and 19.
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
LINEARPROGRAMMING 5/23/ :13 AM 5/23/ :13 AM 1.
Systems of Equations and Inequalities
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
3.4 Review of Linear Programming
9/8/16 In solving a system of equations, when will your answer be “no solution”? Identify the slope and y-intercept: 2
Splash Screen.
ALGEBRA II HONORS/GIFTED SECTION 3-4 : LINEAR PROGRAMMING
Linear Systems Chapter 3.
Warm Up Is (4,2) a solution to the system Y > 3x – 2 5y + 4x < 20.
Warm Up Solve the system: 2x + y – 3z = -6 x – y + 2z = 5
3-3 Optimization with Linear Programming
Math3H – Unit 2 Day 3 Linear Programming
Objectives Essential Understanding: Some real-world problems involve multiple linear relationships. Linear programming accounts for all of these linear.
Objective Vocabulary Solve linear programming problems.
Solve the system of inequalities by graphing. x ≤ 2 y > 3
Graphing Systems of Linear Inequalities
3.4b: Linear Programming ~ Application
Linear Programming Example: Maximize x + y x and y are called
Systems of Inequalities. Linear Programming
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Applications of Linear Programming
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 1.3 M3.
Linear Programming Mr. Carpenter Alg. 2.
Linear Programming.
Presentation transcript:

Warm Up Graph the following inequalities 1) Y > 3x – 2 2) 5y + 4x < 20

3-6: 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.

What is a constraint? A restriction... A boundary… A limitation…

What is the feasible region? The feasible region is the area of the graph in which all the constraints are met.

Complete the worksheet and turn in!

Example 1 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?

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

Step 2: Write a System of Inequalities Write the constraints. What are the limitations given in the problem? 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. 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.

Step 3: Graph the Inequalities c s The purple area is the feasible region.

Step 4: Name the Vertices of the Feasible Region Find the coordinates of the vertices of the feasible region, the area inside the polygon. (0,275) (225,0) (0,0) (75,200)

Step 5: Write an Equation to be Maximized or Minimized 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.

Step 6: Substitute the Coordinates into the Equation Substitute the coordinates of the vertices into the maximum profit equation.

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) (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.

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?

Step 1: Define the Variables Let x = number of girders Let y = number of rods Step 2: Write a System of Inequalities 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.

Step 3: Graph the Inequalities

Step 3: Graph the Inequalities

Step 3: Graph the Inequalities The purple region represents the feasible region.

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)

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

Step 6: Substitute the Coordinates into the Equation Substitute the coordinates of the vertices into the maximum profit equation.

Step 7: Find the Maximum 40 girders and 60 rods of steel should be produced for a maximum profit of $680.

Explore… Suppose the mill produces 150 units of steel a day, how does this change the feasible region? 2. Can the mill increase profits with the new feasible region?

Try these: A theater, at which a drug abuse program is being presented, seats 150 people. The proceeds will be donated to a local drug information center. Admission is $2 for adults and $1 for students. Every two adults must bring at least one student. How many adults and students should attend in order to raise the maximum amount of money?

The available parking area of a parking lot is 600 square meters The available parking area of a parking lot is 600 square meters. A car requires 6 square meters of space and a bus requires 30 square meters of space. The attendant can handle no more than 60 vehicles. If a car is charged $3.00 to park and a bus is charged $8.00, how many of each should the attendant accept to maximize income?