Solve linear programming problems. Objective linear programming constraint feasible region objective function Vocabulary.

Slides:



Advertisements
Similar presentations
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Advertisements

Linear Programming Project. Warm-Up Write an Inequality for the following.
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.
Objective 3-4 Linear Programming Solve linear programming problems.
Linear Programming Unit 2, Lesson 4 10/13.
3.4 Linear Programming.
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.
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
3.4 Review of Linear Programming
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.
Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities.
Linear Programming Objective: I can solve problems using linear programming.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
Objective Vocabulary Solve linear programming problems.
Warm up  Write the equation of a quadratic function with a vertical compression of 0.2 that is shifted left 1 and up 7.  At a clothing store, shirts.
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. Many mathematical models designed to solve problems in business, biology, and economics involve finding the optimum value (maximum.
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.
11/20/2015 6:37 AM1 1 LINEAR PROGRAMMING Section 3.4, ©2008.
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!
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.
December 4, 2015 Hanging with Harvard 4 L INEAR P ROGRAMMING.
Holt McDougal Algebra Linear Programming Linear programming is method of finding a maximum or minimum value of a function that satisfies a given.
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-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.
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.
LINEARPROGRAMMING 5/23/ :13 AM 5/23/ :13 AM 1.
Digital Lesson Linear Programming.
Digital Lesson Linear Programming.
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
9/8/16 In solving a system of equations, when will your answer be “no solution”? Identify the slope and y-intercept: 2
ALGEBRA II HONORS/GIFTED SECTION 3-4 : LINEAR PROGRAMMING
Linear Systems Chapter 3.
3-3 Optimization with Linear Programming
Linear Programming Objectives: Set up a Linear Programming Problem
Do Now! Solve the system of equations Do all work on the notecard.
Objectives Essential Understanding: Some real-world problems involve multiple linear relationships. Linear programming accounts for all of these linear.
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Objective Vocabulary Solve linear programming problems.
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
Systems of Inequalities and Linear Programming
Chapter 7: Systems of Equations and Inequalities; Matrices
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.
Linear Programming.
Presentation transcript:

Solve linear programming problems. Objective linear programming constraint feasible region objective function Vocabulary

 What type of plants:  Need to ask what are my objectives and constraints  Need to think about price, the amount of water required, and the amount of CO₂ absorbed

 Linear programming is a method of finding a maximum or minimum value of an objective function that satisfies a given set of conditions called constraints  “My objective (what I want) is to absorb as much CO₂ as possible BUT I have certain constraints”

 Gillian is planning a green roof that will cover up to 600 square feet using either blue lagoon sedum and raspberry red sedum. Each blue sedum will cover 1.2 square feet. Each raspberry red sedum will cover 2 square feet. Each plant cost $2.50, and Gillian must spend less than $1000. Gillian wants to maximize CO₂ absorption.

 What do we want?  A: To maximize CO₂  Formula for total CO₂?  A: C=1.4b+2.1r  Objective Function  What do we need to know?  A:How much of each plants to use  What are our constraints? Let’s look back at the question

*Notice that all the constraints involve the same variables *We can use the graph of these constraints to find the number of each types of plants

*Feasible Region? b- and r- values that satisfy the inequalities  BUT…….  Which combination of b and r (which point) would maximize CO₂ absorption (objective)?  The Vertex Principle of Linear Programming  If an objective function has a maximum or minimum value, it must occur at one or more of the vertices of the feasible region.

 C=1.4b+2.1r

 Write inequalities for all the constraints  Graph the constraints inequalities to find the feasible region  Write an equation for the objective  Substitute the vertices points from the feasible region into the objective function  Determine which point maximized or minimized your objective

Sue manages a soccer club and must decide how many members to send to soccer camp. It costs $75 for each advanced player and $50 for each intermediate player. Sue can spend no more than $13,250. Sue must send at least 60 more advanced than intermediate players and a minimum of 80 advanced players. Find the number of each type of player Sue can send to camp to maximize the number of players at camp. Example 3: Problem-Solving Application