Advanced Algebra II Notes 6.6 Linear Programming

Slides:



Advertisements
Similar presentations
NO Graphing Calculators You may use scientific calculators.
Advertisements

S EPTEMBER 14, L INEAR P ROGRAMMING Linear programming = a process of maximizing a linear objective function Objective function = gives a quantity.
Objective 3-4 Linear Programming Solve linear programming problems.
Linear Programming Unit 2, Lesson 4 10/13.
B-1 Operations Management Linear Programming Module B.
B-1 Operations Management Linear Programming Module B.
Inequalities Continues
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
Lesson 6.6.  Industrial managers must consider physical limitations, standards of quality, customer demand, availability of materials, and manufacturing.
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Warm-Up Find all of the possible solutions to the following:
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
3.4 Review of Linear Programming
Determine if the given ordered pair is a solution of
Linear Programming A Summary. What??  Linear Programming is an algebraic strategy used to find optimal solutions. –Uses linear inequalities called constraints.
Ardavan Asef-Vaziri Systems and Operations Management
Linear Programming Objective: I can solve problems using linear programming.
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Do the algebra required to find a simultaneous solutions to these two equations (from last class): 3x 1 + x 2  3 x 1 + 3x 2  5 1.
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.
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
Intro to Linear Programming
Healthy Animals Curtis is concerned about the
Warm-up Solve each system of equations:
Linear Programming Ex1) Use the system of constraints below to maximize the objective function z = -0.4x + 3.2y. Corner Points.
Constraints Feasible region Bounded/ unbound Vertices
Linear Programming. Example x:x:Number of cars built Define the Variables Does it matter? y:y:Number of trucks built.
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.
Holt McDougal Algebra Linear Programming Linear programming is method of finding a maximum or minimum value of a function that satisfies a given.
Food Label Activity Ms. Levasseur Biology. Purpose: To examine the typical teenage diet and compare the organic compounds ingested to those required for.
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.
LINEAR PROGRAMMING: ALGEBRAIC METHODS Have you been thinking this since the last lesson? “There’s got to be an easier way than testing all those possible.
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.
3.3 Linear Programming. Vocabulary Constraints: linear inequalities; boundary lines Objective Function: Equation in standard form used to determine the.
Linear Programming Healthy Animals. Algebra Standards   MM3A6. Students will solve linear programming problems in two variables.   a. Solve systems.
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 A-CED.3 REPRESENT CONSTRAINTS BY EQUATIONS OR INEQUALITIES, AND BY SYSTEMS OF EQUATIONS AND/OR INEQUALITIES, AND INTERPRET SOLUTIONS.
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.
Applications of Linear Programming
LINEARPROGRAMMING 5/23/ :13 AM 5/23/ :13 AM 1.
Systems of Equations and Inequalities
Operations Management Linear Programming Module B
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
3.4 Review of Linear Programming
NUTRITIONAL FACTS.
Reading Nutrition Fact Labels
ALGEBRA II HONORS/GIFTED SECTION 3-4 : LINEAR PROGRAMMING
Linear Systems Chapter 3.
Linear Programming Objectives: Set up a Linear Programming Problem
Lial/Hungerford/Holcomb/Mullins: Mathematics with Applications 11e Finite Mathematics with Applications 11e Copyright ©2015 Pearson Education, Inc. All.
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
3.4b: Linear Programming ~ Application
NUTRITION.
Linear Programming Example: Maximize x + y x and y are called
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Nutrition Facts Calories 250 Calories from Fat 120 Total Fat 13g 10%
Copyright © 2019 Pearson Education, Inc.
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
10.8 Linear Programming.
Food Labels and Nutritional Values
1.6 Linear Programming Pg. 30.
Linear Programming Mr. Carpenter Alg. 2.
Presentation transcript:

Advanced Algebra II Notes 6.6 Linear Programming The Elite Pottery Shoppe makes two kinds of birdbaths: a fancy glazed and a simple unglazed. An unglazed birdbath requires .5 h to make using a pottery wheel and 3 h in the kiln. A glazed birdbath takes 1 h on the wheel and 18 h in the kiln. The company’s one pottery wheel is available for at most 8 hours per day (h/d). The three kilns can be used a total of at most 60 h/d. The company has a standing order for 6 unglazed birdbaths per day, so it must produce at least that may. The pottery shop’s profit on each unglazed birdbath is $10, and the profit on each glazed birdbath is $40. How many of each kind of birdbath should the company produce each day in order to maximize profit?

Amount per unglazed Birdbath Amount per glazed Constraining value Wheel hours Kiln hours Profit

Profit equation: _____________________________   Constraint inequalities: _______________________________ _______________________________ Vertices of feasible region: _________________________________________

Marco is planning a snack of graham crackers and blueberry yogurt to provide at his school’s track practice. Because he is concerned about health and nutrition, he wants to make sure that the snack contains no more than 700 calories and no more than 20 g of fat. He also wants at least 17 g of protein and at least 30% of the daily recommended value of iron. The nutritional content of each food is listed in the table below. Each serving of yogurt costs $0.30 and each graham cracker costs $0.06. What combination of servings of graham crackers and blueberry yogurt should Marco provide to minimize cost? Serving Calories Fat Protein Iron (percent of daily Recommended value) Graham crackers 1 cracker 60 2 g 6% Blueberry yogurt 4.5 oz 130 5 g 1 %

Amount per graham cracker Amount per serving of yogurt Limiting value Calories Fat Protein Iron Cost

Cost equation: _____________________________ Constraint inequalities: _______________________________ _______________________________ ________________________________   Vertices of feasible region: _________________________________________

Assignment: page 347: 1 – 8