3.4 Linear Programming p. 163. Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.

Slides:

Advertisements

Similar presentations

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

Advertisements

3.4 Linear Programming.

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.

Linear Programming 1.6 (M3) p. 30 Test Friday !!.

S EPTEMBER 14, L INEAR P ROGRAMMING Linear programming = a process of maximizing a linear objective function Objective function = gives a quantity.

Example 1 Define the Variables: Let l = length of package g = girth of package Two variables – two inequalities: Graph each inequality. Don’t forget to.

Linear Programming Unit 2, Lesson 4 10/13.

3.4 Linear Programming.

Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem.

4.3.1 – Systems of Inequalities. Recall, we solved systems of equations What defined a system? How did you find the solutions to the system?

Graph and solve systems of linear inequalitites A-CED 3.

Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities.

Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities.

Systems of Linear Equations and Inequalities (Chapter 3)

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.

Unit 1.6 – 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.

3.5 Linear Programming Warm-up (IN) 1. Solve the system: (5, 2)

Warm-Up Graph the following system of inequalities. Find the coordinates at each vertices.

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.

Class Schedule: Class Announcements Homework Questions 3.4 Notes Begin Homework.

Linear Programming 1.4 Algebra II.

Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.

3.4 – Linear Programming. Ex. 1 Graph the system of inequalities. Name the coordinates of the vertices of the feasible region. Find the max & min values.

Alg 2 - Chapter 3 Jeopardy Solving Systems by Graphing Solving Systems Algebraically Graph & Solving Systems of Linear Inequalities Linear Programming.

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!

Review Homework Page Rocket City Math League There are five levels of three rounds of individual testing that range from Pre-Algebra to Calculus,

3-4 Linear Programming (p. 139) Algebra 2 Prentice Hall, 2007.

Constraints Feasible region Bounded/ unbound Vertices

Chapter 2 Systems of Linear Equations and Inequalities.

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”

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.

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.

LINEAR PROGRAMMING A-CED.3 REPRESENT CONSTRAINTS BY EQUATIONS OR INEQUALITIES, AND BY SYSTEMS OF EQUATIONS AND/OR INEQUALITIES, AND INTERPRET SOLUTIONS.

Linear Programming Chapter 3 Lesson 4 Vocabulary Constraints- Conditions given to variables, often expressed as linear inequalities. Feasible Region-

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.

Systems of Inequalities

3.2 Linear Programming 3 Credits AS

3-3 Optimization with Linear Programming

Linear Programming.

3.4 – Linear Programming.

3.2 Linear Functions.

8.4 Linear Programming p

Graphing Systems of Linear Inequalities

LESSON 6–5 Linear Optimization.

Warm Up Solve for x:

LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.

Section Linear Programming

1.6 Linear Programming Pg. 30.

Presentation transcript:

3.4 Linear Programming p. 163

Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where you optimize an objective function with a system of linear inequalities called constraints. The overlapped shaded region is called the feasible region.

Solving a linear programming problem 1.Graph the constraints. 2.Locate the ordered pairs of the vertices of the feasible region. 3.If the feasible region is bounded (or closed), it will have a minimum & a maximum. If the region is unbounded (or open), it will have only one (a minimum OR a maximum). 4. Plug the vertices into the linear equation (C=) to find the min. and/or max.

A note about: Unbounded Feasible Regions If the region is unbounded, but has a top on it, there will be a maximum only. If the region is unbounded, but has a bottom, there will be a minimum only.

Find the min. & max. values of C=-x+3y subject to the following constraints. x  2 x  5 y  0 y  -2x+12 Vertices of feasible region: (2,8) C= -2+3(8)= 22 (2,0) C= -2+3(0)= -2 (5,0) C= -5+3(0)= -5 (5,2) C= -5+3(2)= 1 Max. of 22 at (2,8) Min. of -5 at (5,0)

Ex: C=x+5y Find the max. & min. subject to the following constraints x0x0 y  2x+2 5  x+y Vertices? (0,2) C=0+5(2)=10 (1,4) C=1+5(4)=21 Maximum only! Max of 21 at (1,4)

Linear Programming You want to buy tickets for some concerts; rock and jazz. You want at least 5 rock tickets and at least 8 jazz tickets. No more than 20 total tickets. Rock tickets cost $3 and jazz tickets cost $5. You cannot spend more than $80. Find the number of each type of ticket you can buy at the lowest price total.