CCMIII U2D3 Warmup Multiple Choice: Choose the best answer for each. 1. Solve x – (-38) ≥ -51 (a) x ≥ -89(b) x ≤ -13(c) x ≤ 89(d) x ≥ -13 2. Solve 6x ˃

Slides:



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

Linear Programming. Businesses use linear programming to find out how to maximize profit or minimize costs. Most have constraints on what they can use.
Do Now The cost of renting a pool at an aquatic center id either $30 an hr. or $20 an hr. with a $40 non refundable deposit. Use algebra to find for how.
3.4 Linear Programming.
CCMIII U2D4 Warmup This graph of a linear programming model consists of polygon ABCD and its interior. Under these constraints, at which point does the.
Ch 2. 6 – Solving Systems of Linear Inequalities & Ch 2
3-5: Linear Programming.
Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem.
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.
Graph and solve systems of linear inequalitites A-CED 3.
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 1.3 M Warm-Up Graph the system.
Solve problems by using linear programming.
Systems of Inequalities in Two Variables Sec. 7.5a.
3.5 Linear Programming Warm-up (IN) 1. Solve the system: (5, 2)
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 Advanced Math Topics Mrs. Mongold.
Class Schedule: Class Announcements Homework Questions 3.4 Notes Begin Homework.
Linear Programming Solving Systems of Equations with 3 Variables Inverses & Determinants of Matrices Cramer’s Rule.
Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.
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
Linear Programming-Bellwork
Ch. 3 Notes Page 19 P19 3.4b: Linear Programming.
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.
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.
September 19, 2012 More multi-step equations and consecutive integer problems Warm-up: Do one group’s multi-step review sheet. When you are done, compare.
3-4: Linear Programming Objectives: Standards addressed:
3.4: Linear Programming  Intro: Oftentimes we want to optimize a situation - this means to:  find a maximum value (such as maximizing profits)  find.
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.4 Linear Programming Objective:
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 system: 2x + y – 3z = -6 x – y + 2z = 5 3x + 2y – z = 4.
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.6 Solving Systems of Linear Inequalities
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.
Do Now The cost of renting a pool at an aquatic center is either $30 an hr. or $20 an hr. with a $40 non refundable deposit. Use algebra to find for how.
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)
ALGEBRA II HONORS/GIFTED SECTION 3-4 : LINEAR PROGRAMMING
3.2 Linear Programming 3 Credits AS
Warm Up Solve the system: 2x + y – 3z = -6 x – y + 2z = 5
3-3 Optimization with Linear Programming
Linear Programming.
Math3H – Unit 2 Day 3 Linear Programming
Linear Programming Objectives: Set up a Linear Programming Problem
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.
2-4 Solving Multi-Step Equations
3-4 Linear Programming.
Solve the system of inequalities by graphing. x ≤ 2 y > 3
8.4 Linear Programming p
Graphing Systems of Linear Inequalities
Warm Up Solve for x:
Systems of Inequalities. 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.
Presentation transcript:

CCMIII U2D3 Warmup Multiple Choice: Choose the best answer for each. 1. Solve x – (-38) ≥ -51 (a) x ≥ -89(b) x ≤ -13(c) x ≤ 89(d) x ≥ Solve 6x ˃ 5x + 19 (a) x ≤ 19(b) x ≤ (c) x ≥ -19(d) x ≥ The sum of 2 consecutive odd integers is at most 12. What is the greatest integer? (a) 3 (b) 5(c) 7(d) Distribute playing cards for Lego activity

Homework Check: Document Camera

M3U2D3 Linear Programming OBJECTIVES: - Determine feasible regions pertaining to maximum and minimum conditions -Use geometric methods to solve multi – step problems

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

The Lego Activity

# of tables # of chairs 16 10

The Lego Activity 2tc12 2t2c16 2t + c < 122t + 2c < 16 t > 0c > 0

The Lego Activity

4 Tables, 4 Chairs

Ex 1: Find the minimum and maximum value of the function f(x, y) = 3x - 2y. We are given the constraints: y ≥ 2 1 ≤ x ≤5 y ≤ x + 3

Linear Programming Find the minimum and maximum values by graphing the inequalities and finding the vertices of the polygon formed. Substitute the vertices into the function and find the largest and smallest values.

y ≤ x + 3 y ≥ 2 1 ≤ x ≤5

Linear Programming The vertices of the quadrilateral formed are: (1, 2) (1, 4) (5, 2) (5, 8) Plug these points into the original function: f(x, y) = 3x - 2y

Linear Programming f(x, y) = 3x - 2y f(1, 2) = 3(1) - 2(2) = = -1 f(1, 4) = 3(1) - 2(4) = = -5 f(5, 2) = 3(5) - 2(2) = = 11 f(5, 8) = 3(5) - 2(8) = = -1

Linear Programming f(1, 4) = -5 minimum f(5, 2) = 11 maximum

Ex 2: Find the minimum and maximum value of the function f(x, y) = 4x + 3y We are given the constraints: y ≥ -x + 2 y ≤ x + 2 y ≥ 2x -5

y ≥ -x + 2 y ≥ 2x -5

Vertices f(x, y) = 4x + 3y f(0, 2) = 4(0) + 3(2) = 6 f(4, 3) = 4(4) + 3(3) = 25 f(, - ) = 4( ) + 3(- ) = -1 =

Linear Programming f(0, 2) = 6 minimum f(4, 3) = 25 maximum

Classwork Corn & Beans #1-3 checked in class

HW Check – Corn & Beans

Homework Finish Corn & Beans #4-7