Factor as many polynomials as you can.

Slides:



Advertisements
Similar presentations
3.4 Linear Programming.
Advertisements

Standard  MM3A6. Students will solve linear programming problems in two variables.  a. Solve systems of inequalities in two variables, showing the solutions.
1. Vertex 2. Fundamental Theorem of Linear Programming 3. Linear Programming Steps 1.
Linear Programming Pre-Calc Section 3.4 Running a profitable business requires a careful balancing of resources (for example, peoples’ time, materials,
Lesson 7.6, page 767 Linear Programming
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.
1 © 2010 Pearson Education, Inc. All rights reserved © 2010 Pearson Education, Inc. All rights reserved Chapter 8 Systems of Equations and Inequalities.
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.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
Solve problems by using linear programming.
 A concert promoter wants to book a rock group for a stadium concert. A ticket for admission to the stadium playing field will cost $125, and a ticket.
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.
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.
Linear Programming Problem. Definition A linear programming problem is the problem of optimizing (maximizing or minimizing) a linear function (a function.
3  Graphing Systems of Linear Inequalities in Two Variables  Linear Programming Problems  Graphical Solutions of Linear Programming Problems  Sensitivity.
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
11C. Linear Programming. What is a linear programming problem? 1.A set of variables (in Further Maths there will only ever be two variables) called decision.
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
Linear Programming Advanced Math Topics Mrs. Mongold.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 7 Algebra: Graphs, Functions, and Linear Systems.
3.4 Linear Programming Rita Korsunsky. Example: Maximizing a Profit A small TV manufacturing company produces console and portable TV’s using three different.
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!
Thinking Mathematically Algebra: Graphs, Functions and Linear Systems 7.5 Linear Programming.
M3 1.5 Systems of Linear Inequalities M3 1.5 Systems of Linear Inequalities Essential Questions: How can we write and graph a system of linear inequalities.
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.
3.4 Linear Programming Solve linear programming problems in two variables using graphical methods.
Section 3-4 Objective: To solve certain applied problems using linear programming. Linear Programming.
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.
Linear Programming Chapter 3 Lesson 4 Vocabulary Constraints- Conditions given to variables, often expressed as linear inequalities. Feasible Region-
Precalculus Section 3.4 Solve problems using linear programming The inequalities that describe all the conditions of a problem are called constraints.
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.
Digital Lesson Linear Programming.
Systems of Equations and Inequalities
Systems of Equations and Inequalities
Digital Lesson Linear Programming.
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
ALGEBRA II HONORS/GIFTED SECTION 3-4 : LINEAR PROGRAMMING
3-3 Optimization with Linear Programming
Linear Programming Objectives: Set up a Linear Programming Problem
Algebra: Graphs, Functions, and Linear Systems
Warm Up Graph y = 4x and 16, $10’s and 7 $20’s.
Factor as many polynomials as you can.
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Warm Up Solve for x:
Linear Programming Example: Maximize x + y x and y are called
Graphical Solution of Linear Programming Problems
Systems of Inequalities and Linear Programming
Systems of Inequalities. Linear Programming
Chapter 7: Systems of Equations and Inequalities; Matrices
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Warm Up Graph y = 4x and 16, $10’s and 7 $20’s.
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Nature does nothing uselessly.
1.6 Linear Programming Pg. 30.
Presentation transcript:

Factor as many polynomials as you can. Warm Up Factor as many polynomials as you can.

3-4 Linear Programming A method for solving decision-making problems in which a linear expression is to be maximized or minimized

Linear Programming Steps Define two variables, x & y. Write a system of linear inequalities in x and y to represent the facts given in the problem. Graph the system of inequalities to determine a feasible region. Find the coordinates of each corner point of the feasible region. Write a function in the form ax + by to be maximized or minimized. Evaluate the function ax + by at each corner point. Select the required minimum or maximum value, which will occur at one of the corner points, and note the values of x and y at that point.

3.4 Linear Programming Machine Console Portable Hours Available A 1 h 16 B 9 C 4 h 24

The # of TV’s cannot be negative. Machine Console Portable Hours available x y A 1 h 2 h 16 B 9 C 4 h 24 The # of TV’s cannot be negative.

Constraints

Vitamin A 2 mg 1 mg 4 mg Vitamin B 3 mg 11 mg Vitamin C 25 mg 50 mg Brand X Brand Y Minimum Daily Need Vitamin A 2 mg 1 mg 4 mg Vitamin B 3 mg 11 mg Vitamin C 25 mg 50 mg 100 mg Cost/Pill 6 cents 8 cents

Brand X Brand Y Minimum Daily Need Vitamin A 2 mg 1 mg 4 mg Vitamin B 3 mg 11 mg Vitamin C 25 mg 50 mg 100 mg Cost/Pill 6 cents 8 cents

Corner Points (0,4) (1,2) (3,0.5) (4,0) 6(0)+8(4)=32 cents

Homework Page 112 #1-9 odds