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.

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

5.2 Linear Programming in two dimensions: a geometric approach In this section, we will explore applications which utilize the graph of a system of linear.
S EPTEMBER 14, L INEAR P ROGRAMMING Linear programming = a process of maximizing a linear objective function Objective function = gives a quantity.
Objective 3-4 Linear Programming Solve linear programming problems.
3.4 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.
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
3.4 Review of Linear Programming
Determine if the given ordered pair is a solution of
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.
Chapter 12 Section 12.1 The Geometry of Linear Programming.
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.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
Objective Vocabulary Solve linear programming problems.
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.
Solve problems by using linear programming.
Unit 1.6 – Linear Programming
System of Inequalities Objective: I can graph a system of two linear inequalities.
3.5 Linear Programming Warm-up (IN) 1. Solve the system: (5, 2)
Warm-Up Graph the following system of inequalities. Find the coordinates at each vertices.
Notes 7.5 – Systems of Inequalities. I. Half-Planes A.) Given the inequality, the line is the boundary, and the half- plane “below” the boundary is the.
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
11/20/2015 6:37 AM1 1 LINEAR PROGRAMMING Section 3.4, ©2008.
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!
Solving Problems using Linear Systems. Type #1: Arithmetic The sum of two numbers is 255. When the smaller is subtracted from the larger, the result is.
3-4 Linear Programming (p. 139) Algebra 2 Prentice Hall, 2007.
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.
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)
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.
Warm Up Graph the following system of inequalities Y > 3x – 2 5y + 4x < 20.
1 What you will learn  Lots of vocabulary!  How to find the maximum and minimum value of a function given a set of “rules”
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.
3.4 Linear Programming p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
Precalculus Section 3.4 Solve problems using linear programming The inequalities that describe all the conditions of a problem are called constraints.
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.
3.3 Linear Programming.
LINEARPROGRAMMING 5/23/ :13 AM 5/23/ :13 AM 1.
Systems of Inequalities
Ch. 3.4 I can solve problems using linear programming
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
ALGEBRA II HONORS/GIFTED SECTION 3-4 : LINEAR PROGRAMMING
Linear Systems Chapter 3.
Linear Programming Skill 45.
3-3 Optimization with Linear Programming
and Graphing Inequalities
Linear Programming Objectives: Set up a Linear Programming Problem
Objective Vocabulary Solve linear programming problems.
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Factor as many polynomials as you can.
LESSON 6–5 Linear Optimization.
Warm Up Solve for x:
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.
1.6 Linear Programming Pg. 30.
Linear Programming.
Presentation transcript:

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 each day Write an essay between two and five pages long Do not spend more than $10 on candy and popcorn Collect at least 20 snicker bars while trick or treating P > 1 2 ≤ E ≤ 5 c + p ≤ 10 S ≥ 20

Homework Q & A

Linear Programming Objective: I can solve problems using linear programming.

Constraints: Inequalities Feasible region: All points that satisfy the constraints Objective Function: Quantity you want to maximize or minimize Vertices of feasible region will be maximum or minimum Linear Programming: Method for finding a minimum or maximum of some quantity given constraints

Maximum Minimum Objective Function: Find the maximum or minimum points Vertices: (0, 0) (2, 0) (4, 2) (0, 4) Test Vertices 2(0) + 0 = 0 2(2) + 0 = 4 2(4) + 2 = 10 2(0) + 4 = 4

Total 10x Minutes to work Number Cost Profit x 4x4x 6x6x 30y y 20y 22y 50 20(60) = ≤ ≤ ≥ Maximize T-Shirts 10 minutes to make Supplies cost $4 Profit $6 Sweatshirts 30 minutes to make Supplies cost $20 Profit $22 Sweatshirts (y) T-Shirts (x) You are printing T-shirts and sweatshirts to sell before homecoming. You have at most 20 hours to work. You can spend no more than $600 and you must sell at least 50 items

Maximum T-Shirts (x)Sweatshirts (y)Total Minutes to work10x30y≤ 1200 Cost4x4x20y≤ 600 Numberxy≥ 50 Profit6x6x22ymaximize 300 6(50)+22(0) = ( 50, 0) 700 6(25)+22(25) = (25, 25) 780 6(75)+22(15) = (75, 15) 7206(120)+22(0) =(120, 0) p.160:10-12, odd 75 T-shirts, 15 Sweatshirts Vertices:Test Vertices

Paying for College You have been given $40,000 to invest for a college scholarship. You must invest in both stocks and bonds. Let x represent the dollars invested in stocks. Let y represent the dollars invested in bonds. What inequality can you write to represent the amount of money invested in stocks and bonds? Stocks Bon ds

Paying for College Each investment requires a minimum purchase of $5,000 What are your new inequalities? Since stocks are more risky you want to at least twice as many bonds as stocks. What is the inequality? Stocks Feasible Region Bon ds Constraints Pg 339 #1-3, 5