ALGEBRA II HONORS/GIFTED SECTION 3-4 : LINEAR PROGRAMMING

Slides:

Advertisements

Similar presentations

Linear Programming. Businesses use linear programming to find out how to maximize profit or minimize costs. Most have constraints on what they can use.

Advertisements

3-3 Solving Systems of Inequalities by Graphing

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. Many problems involve quantities that must be maximized or minimized. Businesses are interested in maximizing profit. An operation.

Fri 10/2 Lesson 2 – 8 Learning Objective: To graph two variable inequalities Hw: Pg. 118 #8 – 17, 39 – 41, *46.

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.

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.

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

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.

5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.

Linear Programming Advanced Math Topics Mrs. Mongold.

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

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

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.

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.

x y Example 1 x y X = 3.

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.

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.

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.

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

3.3 Linear Programming.

Systems of Equations and Inequalities

Linear Programming: The Graphical Method

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

ALGEBRA II HONORS/GIFTED - SECTION 2-8 (Two-Variable Inequalities)

ALGEBRA I - SECTION 6-6 (Systems of Linear Inequalities)

Linear Systems Chapter 3.

3.2 Linear Programming 3 Credits AS

3-3 Optimization with Linear Programming

Linear Programming.

Linear Programming Objectives: Set up a Linear Programming Problem

3.4 – Linear Programming.

Algebra: Graphs, Functions, and Linear Systems

3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz

Factor as many polynomials as you can.

Graphing Systems of Linear Inequalities

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. Linear Programming

Copyright © 2014, 2010, 2007 Pearson Education, Inc.

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

ALGEBRA I - SECTION 6-6 (Systems of Linear Inequalities)

Nature does nothing uselessly.

Section Linear Programming

1.6 Linear Programming Pg. 30.

Linear Programming.

Section – Linear Programming

Presentation transcript:

ALGEBRA II HONORS/GIFTED SECTION 3-4 : LINEAR PROGRAMMING @ SECTION 3-4 : LINEAR PROGRAMMING ALGEBRA II HONORS/GIFTED - SECTION 3-4 (Linear Programming)

Graph the system of inequalities on one coordinate system (but off to the side!). x + y < 6 2x + y < 10 x > 0 y > 0 ALGEBRA II HONORS/GIFTED - SECTION 3-4 (Linear Programming)

What are the constraints for this problem? LINEAR PROGRAMMING : A method for finding minimum or maximum values for some quantity given a set of constraints. What are the constraints for this problem? The four inequalities. FEASIBLE REGION : The points that satisfy all of the constraints. ALGEBRA II HONORS/GIFTED - SECTION 3-4 (Linear Programming)

Where is the feasible region for our graph? Note it on the graph. OBJECTIVE FUNCTION : The quantity you are trying to minimize or maximize. In our case, the objective function is P = 4x + y, which we are trying to maximize. ALGEBRA II HONORS/GIFTED - SECTION 3-4 (Linear Programming)

What are the vertices for our problem? In order to find the minimum or maximum, we need to look at the vertices of the feasible region. The vertices occur at the corners of the feasible region. What are the vertices for our problem? (5, 0), (4, 2), (0, 6), (0,0) How do we find the maximum? Test each of the points. ALGEBRA II HONORS/GIFTED - SECTION 3-4 (Linear Programming)

So, the point (5, 0) generates a maximum. Determine whether the following points satisfy the system of inequalities. List all that apply. (2, 1) (1, 4) (5, 2) (1, 5) (4, 0.5) (3, 2) (2, 1), (3, 2), (1, 4), (4, 0.5), (1, 5) ALGEBRA II HONORS/GIFTED - SECTION 3-4 (Linear Programming)

ALGEBRA II HONORS/GIFTED - SECTION 3-4 (Linear Programming)