© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 7 Algebra: Graphs, Functions, and Linear Systems.

Slides:



Advertisements
Similar presentations
§ 4.5 Linear Programming.
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.
Lesson 7.6, page 767 Linear Programming
Linear Systems Chapter 3 – Algebra 2.
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.
Linear Programming. A linear programming problem is made up of an objective function and a system of constraints. The objective function is an algebraic.
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.
Determine if the given ordered pair is a solution of
Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities.
Chapter 12 Section 12.1 The Geometry of Linear Programming.
Linear Programming. Many problems involve quantities that must be maximized or minimized. Businesses are interested in maximizing profit. An operation.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
Objective Vocabulary Solve linear programming problems.
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.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 7 Algebra: Graphs, Functions, and Linear Systems.
Copyright © 2011 Pearson, Inc. 7.5 Systems of Inequalities in Two Variables.
3.5 Linear Programming Warm-up (IN) 1. Solve the system: (5, 2)
Systems of Nonlinear Equations in Two Variables
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.
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.
Linear Programming Warm Up page 12- write the question and answer it you have 10 mins to complete it. See coaching on page 85.
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
Linear Programming Advanced Math Topics Mrs. Mongold.
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:
Thinking Mathematically Algebra: Graphs, Functions and Linear Systems 7.5 Linear Programming.
3-4 Linear Programming (p. 139) Algebra 2 Prentice Hall, 2007.
Linear Programming-Bellwork
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.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 6 Algebra: Equations and Inequalities.
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.
Algebra 1 Section 7.6 Solve systems of linear inequalities The solution to a system of linear inequalities in two variable is a set of ordered pairs making.
Slide 4- 1 Copyright © 2010 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 1- 1 Copyright © 2010 Pearson Education, Inc. Publishing.
Copyright © 2012 Pearson Education, Inc. Publishing as Addison Wesley CHAPTER 6: Systems of Equations and Matrices 6.1 Systems of Equations in Two Variables.
Linear Inequalities in One Variable
Applications of Linear Programming
Digital Lesson Linear Programming.
Systems of Equations and Inequalities
Linear Programming: The Graphical Method
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
Linear Systems Chapter 3.
3-3 Optimization with Linear Programming
Copyright ©2015 Pearson Education, Inc. All right reserved.
Linear Programming Objectives: Set up a Linear Programming Problem
Algebra: Graphs, Functions, and Linear Systems
Section 11.8 Linear Programming
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Factor as many polynomials as you can.
Warm Up Solve for x:
Linear Programming Example: Maximize x + y x and y are called
Systems of Inequalities and Linear Programming
Systems of Inequalities. Linear Programming
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Nature does nothing uselessly.
Section Linear Programming
1.6 Linear Programming Pg. 30.
Presentation transcript:

© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 7 Algebra: Graphs, Functions, and Linear Systems

© 2010 Pearson Prentice Hall. All rights reserved Linear Programming

© 2010 Pearson Prentice Hall. All rights reserved. Objectives 1.Write an objective function describing a quantity that must be maximized or minimized. 2.Use inequalities to describe limitations in a situation. 3.Use linear programming to solve problems. 3

© 2010 Pearson Prentice Hall. All rights reserved. Objective Functions in Linear Programming A method for solving problems in which a particular quantity that must be maximized or minimized is limited by other factors is called linear programming. An objective function is an algebraic expression in two or more variables describing a quantity that must be maximized or minimized. 4

© 2010 Pearson Prentice Hall. All rights reserved. Bottled water and medical supplies are to be shipped to victims of an earthquake by plane. Each container of bottled water will serve 10 people and each medical kit will aid 6 people. Let x represent the number of bottles of water to be shipped and y the number of medical kits. Write the objective function that describes the number of people that can be helped. Example 1: Writing an Objective Function 5

© 2010 Pearson Prentice Hall. All rights reserved. Solution: Because each water serves 10 people and each medical kit aids 6 people, we have Example 1 continued Using z to represent the number of people helped, the objective function is z = 10x + 6y. For a value of x and a value for y, there is only one value of z. Thus, z is a function of x and y. 6

© 2010 Pearson Prentice Hall. All rights reserved. Constraints on Linear Programming A constraint is expressed as a linear inequality. The list of constraints forms a system of linear inequalities. 7

© 2010 Pearson Prentice Hall. All rights reserved. Example 2: Writing a Constraint Each plane can carry no more than 80,000 pounds. The bottled water weighs 20 pounds per container and each medical kit weighs 10 pounds. Let x represent the number of bottles of water to be shipped and y the number of medical kits. Write an inequality that describes this constraint. 8

© 2010 Pearson Prentice Hall. All rights reserved. Solution: Because each plane carries no more than 80,000 pounds, we have The plane’s weight constraint is described by the inequality 20x + 10y ≤ 80,000. Example 2 continued 9

© 2010 Pearson Prentice Hall. All rights reserved. Solving Problems with Linear Programming Let z = ax + by be an objective function that depends on x and y. Furthermore, z is subject to a number of constraints on x and y. If a maximum or minimum value exists, it can be determined as follows: 1.Graph the system of inequalities representing the constraints. 2.Find the value of the objective function at each corner, or vertex, of the graphed region. The maximum and minimum of the objective function occur at one or more of the corner points. 10