Warm up  Write the equation of a quadratic function with a vertical compression of 0.2 that is shifted left 1 and up 7.  At a clothing store, shirts.

Slides:



Advertisements
Similar presentations
Standard  MM3A6. Students will solve linear programming problems in two variables.  a. Solve systems of inequalities in two variables, showing the solutions.
Advertisements

Warm – up Toya is training for a triathlon and wants to bike and run on the same day. She has less than 3 hours to spend on her workouts. What inequality.
Linear Programming Unit 2, Lesson 4 10/13.
Inequalities Continues
3-5: Linear Programming.
Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem.
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.
Systems. Day 1 Systems of Linear Equations System of Linear Equations: two or more linear equations together The solution of the system of equations.
Solve linear programming problems. Objective linear programming constraint feasible region objective function Vocabulary.
Determine if the given ordered pair is a solution of
Graph and solve systems of linear inequalitites A-CED 3.
Chapter 3 Linear Systems.
Linear Systems Two or more unknown quantities that are related to each other can be described by a “system of equations”. If the equations are linear,
Linear Programming Objective: I can solve problems using linear programming.
Objective Function: Vertices (x, y)Work - plug into p(x, y)Solution Analysis: Constraints: _________________________.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
P I can solve linear programing problem. Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
Objective Vocabulary Solve linear programming problems.
Solve problems by using linear programming.
Unit 1.6 – Linear Programming
Opener. Notes: 3.4 Linear Programming Optimization  Many real-life problems involve a process called optimization.  This means finding a maximum or.
Systems of Inequalities in Two Variables Sec. 7.5a.
Linear Programming: A Geometric Approach3 Graphing Systems of Linear Inequalities in Two Variables Linear Programming Problems Graphical Solution of Linear.
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.
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
Linear Programming Solving Systems of Equations with 3 Variables Inverses & Determinants of Matrices Cramer’s Rule.
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!
Constraints Feasible region Bounded/ unbound Vertices
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.
Greater than or equal to Less than or equal to Greater than Less than Warm Up Copy and fill in the chart. SituationInequality Practice more than an hour.
December 4, 2015 Hanging with Harvard 4 L INEAR P ROGRAMMING.
Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Warm Up Is (4,2) a solution to the system Y > 3x – 2 5y + 4x < 20.
Slide Copyright © 2009 Pearson Education, Inc. 7.6 Linear Programming.
3-5: Linear Programming. Learning Target I can solve linear programing problem.
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.
Warm up Solve the given system by substitution: 1) 2x – y = 7 3x + 3y = - 3 Solve the given system by elimination: 2) -3x + 4y = -4 3x – 6y = 6.
ALGEBRA 2 JANUARY 30, 2009 Chapter 3 Section 4 Part Deux!! Linear Programming.
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.
Chapter 9: Systems of Equations and Inequalities; Matrices
October 18 and 19.
LINEARPROGRAMMING 5/23/ :13 AM 5/23/ :13 AM 1.
Digital Lesson Linear Programming.
Warm Up Solve each inequality for y. 1. 8x + y < 6
Digital Lesson Linear Programming.
Ch. 3.4 I can solve problems using linear programming
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
Linear Systems Chapter 3.
Linear Programming Skill 45.
and Graphing Inequalities
Linear Programming Objectives: Set up a Linear Programming Problem
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Objective Vocabulary Solve linear programming problems.
Warm Up Solve for x:
of Linear Inequalities
Systems of Inequalities. Linear Programming
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Nature does nothing uselessly.
Section Linear Programming
1.6 Linear Programming Pg. 30.
Chapter 2 Section 7 Two-Variable Inequalities
Presentation transcript:

Warm up  Write the equation of a quadratic function with a vertical compression of 0.2 that is shifted left 1 and up 7.  At a clothing store, shirts sell for $10 and sweaters sell for $18. If you bought a total of 20 items and spent $264, how many sweaters did you buy?  If you finish the warm up, study for your quiz!!!

Homework Solutions

Quiz time  Put everything away except for a pencil and a calculator.  You have 15 minutes to complete this quiz. When you are finished, check your work then flip your quiz over on your desk and sit quietly.

THINK/PAIR/SHARE  THINK to yourself: What is a matrix? What do you remember about matrices?  PAIR: Discuss with your partner.  SHARE: With the class.

Solving systems of equations with three variables  Only one way: MATRICES!  Step 1: Standard form  Step 2: Write your coefficient matrix [A] and your solution matrix [B]. Put these in your calculator.  Step 3: Calculate [A] -1 [B].

Example #1 -x + y = 3 5x + y = 9

Example 2: x + y + z = -1 2x – y + 2z = -5 -x + 2y – z = 4

Example #3 5x – 3y – 39 = -2z 4x = -4y + 3z x – 2y + 6z = 14

Example #4:  The first number plus the third number is equal to the second number. The sum of the first number and the second number is six more than the third number. There times the first number minus two times the second number is equal to the third number. What is the sum of the three numbers?

Example #5:  You are training for a triathlon. In your training routine each week, you bike 5 times as far as you run and you run 4 times as far as you swim. One week you trained a total of 200 miles. How many miles did you swim that week?  Write your answer on a sticky note and put it on the wall for a bonus point on your quiz. The point is for effort not accuracy, so show me YOUR OWN answer.

Solving Systems of Inequalities  Only one way!  graphing 1. Put each equation in slope- intercept form and graph 2. Shade to determine the solution region

Example #1 Solve: y ≤ 2x + 3 y ≥ -1/2x + 1

Example #2: Solve: x + 2y ≤ 4 y > -x – 1 x > 2

LINEAR PROGRAMMING  Linear programming is a method for finding a minimum or maximum value of some quantity, given a set of constraints.  It is basically application problems for systems of inequalities.

Linear Programming  Constraints: restrictions on the variables of the objective function in a linear programming problem.  Feasible region: the area bounded by the system of inequalities that contains all the points that satisfy all the constraints.

Linear Programming  Objective function: a model of the quantity you are trying to maximize or minimize.  Vertex (corner) principle of linear programming: If there is a maximum or minimum value of the objective function, it occurs at one or more of the vertices of the feasible region.

Example #1  A city wants to plant maple and spruce trees to absorb carbon dioxide. It has $2100 and 45,000 ft 2 available to plant trees. Using the data from the table, write a system of linear inequalities to model this situation. SpruceMaple Planting Cost $30$40 Area Required 600 ft ft 2 CO 2 absorptio n 650 lb/yr300 lb/yr

Example #1  A city wants to plant maple and spruce trees to absorb carbon dioxide. It has $2100 and 45,000 ft 2 available to plant trees. Graph the feasible region. How many trees of each type should the city plant to maximize absorption?

Example #2 You are screen printing t-shirts and sweatshirts to sell at the Polk County Blues Festival and are working with the following constraints:  You have a most 20 hours to make shirts  You want to spend less than $600 on supplies  You want to have at least 50 items to sell  A 1-color t-shirt takes 10 minutes to make and a 3-color sweatshirt takes 30 minutes to make  Supplies for each t-shirt cost $4 and each sweatshirt $20  You can make a profit of $6 per t-shirt and a profit of $20 per sweatshirt How many t-shirts and sweatshirts should you make to maximize your profit?

Example #2

Journal #1  How are you doing in this class? What are you doing well on? What can you do to improve? What do you like about this class? What would you change? Write a paragraph (at least 5 sentences) and turn it into the box when you are finished. HOMEWORK: WB p. 70 and 74