Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)

Slides:



Advertisements
Similar presentations
30S Applied Math Mr. Knight – Killarney School Slide 1 Unit: Linear Programming Lesson 5: Problem Solving Problem Solving with Linear Programming Learning.
Advertisements

Standard  MM3A6. Students will solve linear programming problems in two variables.  a. Solve systems of inequalities in two variables, showing the solutions.
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ Linear Programming in two dimensions:
S EPTEMBER 14, L INEAR P ROGRAMMING Linear programming = a process of maximizing a linear objective function Objective function = gives a quantity.
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.
Systems. Day 1 Systems of Linear Equations System of Linear Equations: two or more linear equations together The solution of the system of equations.
Determine if the given ordered pair is a solution of
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.
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: A Geometric Approach3 Graphing Systems of Linear Inequalities in Two Variables Linear Programming Problems Graphical Solution of Linear.
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.
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.
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!
Thinking Mathematically Algebra: Graphs, Functions and Linear Systems 7.5 Linear Programming.
3-4 Linear Programming (p. 139) Algebra 2 Prentice Hall, 2007.
Constraints Feasible region Bounded/ unbound Vertices
Linear Programming-Bellwork
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)
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.
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-4: Linear Programming Objectives: Standards addressed:
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.
Copyright © 2015 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Section 7.4 Linear Programming Math in Our World.
Section 7.5 Linear Programming Math in Our World.
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.
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 and 3.4 Applications of Linear Models
LINEARPROGRAMMING 5/23/ :13 AM 5/23/ :13 AM 1.
Systems of Equations and Inequalities
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.
3-3 Optimization with Linear Programming
Linear Programming Objectives: Set up a Linear Programming Problem
Algebra: Graphs, Functions, and Linear Systems
Do Now! Solve the system of equations Do all work on the notecard.
3-4 Linear Programming.
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Factor as many polynomials as you can.
3.4b: Linear Programming ~ Application
Warm Up Solve for x:
Systems of Inequalities and Linear Programming
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.
Presentation transcript:

Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94) #2, 6, 7, 8, 10, 21

Math 1 Warm Up Answers

Math 1 Warm Up Answers

Math 1 Warm Up Answers

Math 1 Warm Up Answers 21a. 10x + 20y ≥ 40, 10x + 20y ≤ 60 x ≥ 0, y ≥ 0 21b.

Questions?

Linear Programming Objective: To learn to find minimum and maximum values of a quantity. linear programming – is a technique that identifies the minimum or maximum values of some quantity express as an equation of two or more variables.

Linear Programming objective equation – is an equation of the quantity that you want to make as large or as small as possible. constraints – are limits on the variables in the objective function written as linear inequalities. feasible region – is the region of the coordinate plane that contains all the points that satisfy all the constraints.

Vertex Principle of Linear Programming “If there is a maximum or a minimum value of the linear objective equation, it occurs at one or more of the vertices of the feasible region.”

Find the values of x and y that maximizes the objective function for the graph below. What is the maximum value? 1.

Find the values of x and y that minimizes the objective function for the graph below. What is the minimum value? 2.

Linear Programming Steps: Graph the constraints. Find the coordinates for each vertex of the feasible region. Evaluate the objective equation at each vertex.

Constraints: x ≤ 8 y ≤ 5 x + y ≤ 2 Objective: C = x + 3y Find the values of x and y that minimizes the objective equation C. What is the minimum value of C? Constraints: x ≤ 8 y ≤ 5 x + y ≤ 2 Objective: C = x + 3y

Constraints: x ≥ 0 y ≥ 0 x ≤ 5 y ≤ 4 Objective: P = 3x + 2y Find the values of x and y that maximizes the objective equation P. What is the maximum value of P? Constraints: x ≥ 0 y ≥ 0 x ≤ 5 y ≤ 4 Objective: P = 3x + 2y

Constraints: x ≥ 0 y ≥ 5 x + y ≥ 8 Objective: F = 2x + 5y Find the values of x and y that minimizes the objective equation F. What is the minimum value of F? Constraints: x ≥ 0 y ≥ 5 x + y ≥ 8 Objective: F = 2x + 5y

Find the values of x and y that maximizes the objective equation P Find the values of x and y that maximizes the objective equation P. What is the maximum value of P? Constraints: x ≥ 0 y ≥ 0 y ≥ 3 2 x – 3 y ≤ -x + 7 Objective: P = 4x + y

Find the values of x and y that maximizes the objective equation N Find the values of x and y that maximizes the objective equation N. What is the maximum value of N? Constraints: x ≥ 0 y ≥ 0 2x + y ≥ 10 x + y ≤ 8 Objective: N = 100x + 40y

Apply! A furniture manufacture can make from 30 to 60 tables per day and 40 to 100 chairs per day. The manufacture can make a most 120 units in one day. The profit on a table is $150, and the profit on a chair is $65. How many tables and chairs should they make to maximize profit? How much is the maximum profit?

Apply! Jerry works no more than 20 hours a week during the school year. He is paid $10 an hour for tutoring math students and $17 an hour for delivering pizzas for Pizza King. He wants to spend at least 3 hours but no more than 8 hours a week tutoring. How many hours should Jerry work at each job to maximize his weekly earning? Find Jerry’s maximum weekly earning.

Assignment Linear Programming Handout