Warm Up Solve for x:

Slides:



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

3.4 Linear Programming 10/31/2008. Optimization: finding the solution that is either a minimum or maximum.
Linear Programming Vocabulary Linear Programming Objective Function Constraints.
Ch 2. 6 – Solving Systems of Linear Inequalities & Ch 2
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.
Linear Programming Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Linear programming is a strategy for finding the.
CHAPTER 7-1 SOLVING SYSTEM OF EQUATIONS. WARM UP  Graph the following linear functions:  Y = 2x + 2  Y = 1/2x – 3  Y = -x - 1.
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.
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 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.
11/20/2015 6:37 AM1 1 LINEAR PROGRAMMING Section 3.4, ©2008.
Class Schedule: Class Announcements Homework Questions 3.4 Notes Begin Homework.
Linear Programming 1.4 Algebra II.
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
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.
1 What you will learn  Lots of vocabulary!  How to find the maximum and minimum value of a function given a set of “rules”
Slide Copyright © 2009 Pearson Education, Inc. 7.6 Linear Programming.
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.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
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 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.
Solving Quadratic Equations by Graphing Need Graph Paper!!! Objective: 1)To write functions in quadratic form 2)To graph quadratic functions 3)To solve.
3.3 Linear Programming.
LINEARPROGRAMMING 5/23/ :13 AM 5/23/ :13 AM 1.
Digital Lesson Linear Programming.
Digital Lesson Linear Programming.
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
2-5 Absolute Value Functions and Graphs
Notes Over 4.2 Is a Solution Verifying Solutions of an Equation
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.
Math3H – Unit 2 Day 3 Linear Programming
Linear Programming Objectives: Set up a Linear Programming Problem
8.4 Linear Programming p
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Factor as many polynomials as you can.
3.4b: Linear Programming ~ Application
Graphical Solution of Linear Programming Problems
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.
L3-3 Objective: Students will graph systems of linear inequalities
Linear Programming Mr. Carpenter Alg. 2.
Linear Programming.
Presentation transcript:

Warm Up Solve for x: 𝟖 𝟑𝒙−𝟓 +𝟏𝟓=𝟕𝟗 𝒍𝒐𝒈 𝟑 𝒙+𝟐 − 𝒍𝒐𝒈 𝟑 𝟒𝒙=𝟓 𝟑𝒙−𝟏 >𝟏𝟏 I can use linear programming to solve real world problems Warm Up Solve for x: 𝟖 𝟑𝒙−𝟓 +𝟏𝟓=𝟕𝟗 𝒍𝒐𝒈 𝟑 𝒙+𝟐 − 𝒍𝒐𝒈 𝟑 𝟒𝒙=𝟓 𝟑𝒙−𝟏 >𝟏𝟏 Verify your solution(s) to number 3 is correct

Warm Up Solve for x: 𝟖 𝟑𝒙−𝟓 +𝟏𝟓=𝟕𝟗

Warm Up Solve for x: 𝒍𝒐𝒈 𝟑 𝒙+𝟐 − 𝒍𝒐𝒈 𝟑 𝟒𝒙=𝟓

Warm Up Solve for x: 𝟑𝒙−𝟏 >𝟏𝟏 Verify your solution(s) to number 3 is correct

Homework Questions

Optimization – Feasible Regions Given the following constraints, maximize and minimize the value of z if z=−0.4𝑥+3.2𝑦 𝑥≥0 𝑦≥0 𝑥≤5 𝑥+𝑦≤7 𝑥+2𝑦≥4 𝑦≤𝑥+5

Feasible Regions Graph constraints Rewrite equations in 𝑦=𝑚𝑥+𝑏 form 𝑥≥0 𝑦≥0 𝑥≤5 𝑦≤−𝑥+7 𝑦≥− 1 2 𝑥+2 𝑦≤𝑥+5

Feasible Regions Identify vertices 0,2 0,5 1,6 5,2 5,0 (4,0)

Feasible Regions Plug each vertex into optimization equation (0,2) Point Equation 𝐳=−𝟎.𝟒𝒙+𝟑.𝟐𝒚 Total (0,2) 𝑧=−0.4 0 +3.2(2) (0,5) 𝑧=−0.4 0 +3.2(5) (1,6) 𝑧=−0.4 1 +3.2(6) (5,2) 𝑧=−0.4 5 +3.2(2) (5,0) 𝑧=−0.4 5 +3.2(0) (4,0) 𝑧=−0.4 4 +3.2(0) 6.4 16.0 18.8 4.4 −2.0 −1.6 Maximum of 18.8 occurs at 1,6 and minimum of -2.0 occurs at (5,0)

Sandy Dandy Dune Buggies Work in table groups Each person will turn in their own paper

Homework Textbook: 5-89 through 5-95a