3-3 Linear Programming.

Slides:



Advertisements
Similar presentations
2.7 Linear Programming.
Advertisements

Applications of Linear Programming
Advanced Algebra Chapter 3
Linear Programming Problem
Linear Programming (LP) Decision Variables Objective (MIN or MAX) Constraints Graphical Solution.
Standard  MM3A6. Students will solve linear programming problems in two variables.  a. Solve systems of inequalities in two variables, showing the solutions.
8/27: Linear Programming Lecture: LP Small Groups Homework.
Ch 2. 6 – Solving Systems of Linear Inequalities & Ch 2
Linear Programming Unit 2, Lesson 4 10/13.
3-5: Linear Programming.
Linear Programming Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Linear programming is a strategy for finding the.
WORD PROBLEMS WITH ANSWERS
Warm - Up. Learning Targets  I can solve systems of inequalities by graphing.  I can determine the coordinates of the vertices of a region formed by.
Linear Programming A Summary. What??  Linear Programming is an algebraic strategy used to find optimal solutions. –Uses linear inequalities called constraints.
Chapter 12 Section 12.1 The Geometry of Linear Programming.
Ardavan Asef-Vaziri Systems and Operations Management
3.3 Systems of Linear Inequalities -graphing -linear programming
Objective Function: Vertices (x, y)Work - plug into p(x, y)Solution Analysis: Constraints: _________________________.
3.4 Linear Programming p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
Linear Programming. What is Linear Programming? Say you own a 500 square acre farm. On this farm you can grow wheat, barley, corn or some combination.
Graphing Linear Inequalities in Two Variables Chapter 4 – Section 1.
Solve problems by using linear programming.
 A concert promoter wants to book a rock group for a stadium concert. A ticket for admission to the stadium playing field will cost $125, and a ticket.
Opener. Notes: 3.4 Linear Programming Optimization  Many real-life problems involve a process called optimization.  This means finding a maximum or.
CDAE Class 12 Oct. 5 Last class: Quiz 3 3. Linear programming and applications Today: Result of Quiz 3 3. Linear programming and applications Next.
Warm-Up Graph the following system of inequalities. Find the coordinates at each vertices.
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
CDAE Class 13 Oct. 10 Last class: Result of Quiz 3 3. Linear programming and applications Class exercise 5 Today: 3. Linear programming and applications.
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.
Warm-up Solve each system of equations:
12/26/2015 Perkins Honors Precalculus Day 10 Sections 10.8 and 10.9.
Get out your Vertices Worksheet!
Linear Programming. Graph the following system of inequalities.
Constraints Feasible region Bounded/ unbound Vertices
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.
Warm Up Is (4,2) a solution to the system Y > 3x – 2 5y + 4x < 20.
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.
1. Solve this system and find the product of its solutions. x + y = 7 2x – y =8 2. The feasible region for a set of constraints has vertices (2,0), (8,2)
Warm Up Solve the system: 2x + y – 3z = -6 x – y + 2z = 5 3x + 2y – z = 4.
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.
Chapter 4 Systems of Equations and Problem Solving
2.7 Linear Programming Objectives: Use linear programming procedures to solve applications. Recognize situations where exactly one solution to a linear.
3.3 and 3.4 Applications of Linear Models
Digital Lesson Linear Programming.
Honors Precalculus Sections 10.8 and 10.9
Digital Lesson Linear Programming.
Lesson 4-3 System of Inequalities
Linear Programming The Graphical Method Review Problems
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
Warm Up Is (4,2) a solution to the system Y > 3x – 2 5y + 4x < 20.
Warm Up Solve the system: 2x + y – 3z = -6 x – y + 2z = 5
3-3 Optimization with Linear Programming
and Graphing Inequalities
Linear Programming.
Linear Programming Objectives: Set up a Linear Programming Problem
Linear Programming.
3.4b: Linear Programming ~ Application
LESSON 6–5 Linear Optimization.
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Nature does nothing uselessly.
1.6 Linear Programming Pg. 30.
Linear Programming Mr. Carpenter Alg. 2.
Do Now Exercise Solve each linear system
Case 2:( Model Construction):
Presentation transcript:

3-3 Linear Programming

Linear Programming- is the process of optimizing a linear objective function. Objective Function- a system of linear inequalities that is optimized Constraints- the boundaries created by the linear inequalities Feasible Region- is the graph that is created by graphing the linear inequalities. Optimization- finding the maximum or minimum value of some quantity.

Step 1 Determine variables, objective function, and constraints Step 2 Graph the constraints. Step 3 Find the vertices Step 4 Test the vertices in objective function bounded region – find both max and min unbounded region – find either max or min, but not both pick a point in the solution set an eliminate the “min” or “max” Step 5 Answer the question

Objective Function: C = –x + 3y Constraints: x > 2 x < 5 y > 0 y < –2x + 12 Objective Function: C = x + 5y x > 0 y < 2x + 2 5 > x +y

1. Behrens Breakfast Bar Company makes fruit-filled breakfast bars and granola bars. For each case of breakfast bars, you make $40 profit. For each case of granola bars, you make $55 profit. To make one case of breakfast bars you need 2 machine hours and 5 labor hours. To make one case of granola bars you need 6 machine hours and 4 labor hours. If there are a maximum of 150 machine hours and a maximum of 155 labor hours, how many of each case should be produced to maximize profits?

2. Shieve Shirt City produces short-sleeved and long sleeved shirts 2. Shieve Shirt City produces short-sleeved and long sleeved shirts. A short-sleeved shirt requires 30 minutes of labor, a long-sleeved shirt requires 45 minutes of labor, and 240 hours of labor are available per day. The maximum number of shirts that can be packaged in a day is 400. If the profits on a short-sleeved shirt and a long-sleeved shirt are $11 and $16, respectively, find the maximum possible daily profit. 3. Cars and trucks are made in Cruz Car Company that is divided into two shops. Shop 1 performs the basic assembly operation working 6 person-days on each truck and only 3 person-days on each car. Shop 2 performs finishing operations, working 4 person-days on each car or truck that it produces. Shop 1 has 150 person-days per week available, while Shop 2 has 120 person-days per week. The manufacturer makes a profit of $500 on each truck and $350 on each car. How many of each should be produced each week to maximize the profit?

4. Funk's Furniture makes chairs and sofas from prepackaged parts 4. Funk's Furniture makes chairs and sofas from prepackaged parts. The table gives the number of packages of wood parts, stuffing, and material required for each chair or sofa. The packages are delivered weekly and the manufacturer has room to store 1300 packages of wood parts, 2000 packages of stuffing, and 800 packages of fabric. The manufacturer earns $200 per chair and $350 per sofa. How many chairs and sofas should they make each week to maximize profit? Material Chair Sofa wood 2 boxes 3 boxes stuffing 4 boxes fabric 1 box

5. Mcghee & Manis TV R Us Company makes color television sets 5. Mcghee & Manis TV R Us Company makes color television sets. The company produces a bargain set which sells for $100 profit and a deluxe set which garners $150 profit. On the assembly line, the bargain set requires 3 hours of time to produce while the deluxe set requires 5 hours. The cabinet shop spends one hour on the cabinet for the bargain set and three hours on the cabinet of the deluxe set. Both set require two hours of time for testing and packaging. On particular production run, the Mark & Marcus TV R Us Company has available 3900 work hours on the assembly line, 2100 work hours in the cabinet shop, and 2200 works hours in the testing and packaging department. How many sets of each type should it produce to maximize its profit? What is the maximum profit?

6. At Mr. Murphy's Moo-Moo Cattle Ranch, they use two brands of cattle feed. Brand X cost $24 per bag and contains two units of nutritional supplement A, 2 units of supplement B, and 2 units of supplement C. Brand Y costs $20 per bag and contains 1 unit of supplement A, 9 units of supplement B, and 3 units of supplement C. Find the number of bags of each brand that should be mixed to minimize your costs, but meet the minimum requirements of nutrients A, B, and C which are 12 units, 36 units, and 24 units, respectively.

7. At Diego's Delicate Flowers and Fruit Farm there are 150 acres of land available to grow grapes and berries. It takes one day to trim an acre of grapes, two days to trim an acre of berries, and there are only 240 days available throughout the year to do this trimming. To pick an acre of grapes requires .3 days while .1 days are needed to harvest an acre of berries. There are only 30 days per year available for harvesting. Find the number of acres for each crop that she should plan in order to maximize her profit assuming that for grapes her profit margin per acre is $140 while for berries she realizes a profit of $235 per acre.

8. A Nicole's Nutrition Center sells health food to mountain-climbing teams. The Trailblazer mix package contains one pound of corn cereal mixed with four pounds of what cereal and sells for $9.75. The Frontier mix contains two pounds of corn cereal mixed with mixed with three pounds of wheat cereal and sells for $9.50. The center has available 60 pounds of corn cereal and 120 pounds of wheat cereal. How many packages of each mix should the center sell to maximize its income?

9. Wood's Wood Furntiture Company can sell all the tables and chairs that it produces. Each table requires 1 hour in the assembly center and 1 1/3 hours in the finishing center. Each chair requires 1 1/2hours in the assembly center and 1 1/2hours in the finishing center. The company’s assembly center is available 12 hours per day, and its finishing center is available 15 hours per day. If the profit on each table is $100 and $50 on each chair, how many of each should be produced to maximize profit?