Applications of 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.4 Linear Programming.
3 – 4 Linear Programming Word Problems
30S Applied Math Mr. Knight – Killarney School Slide 1 Unit: Linear Programming Lesson 5: Problem Solving Problem Solving with Linear Programming Learning.
Standard  MM3A6. Students will solve linear programming problems in two variables.  a. Solve systems of inequalities in two variables, showing the solutions.
Linear Programming Pre-Calc Section 3.4 Running a profitable business requires a careful balancing of resources (for example, peoples’ time, materials,
S EPTEMBER 14, L INEAR P ROGRAMMING Linear programming = a process of maximizing a linear objective function Objective function = gives a quantity.
Lesson 7.6, page 767 Linear Programming
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.
Determine if the given ordered pair is a solution of
Chapter 12 Section 12.1 The Geometry of Linear Programming.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
P I can solve linear programing problem. Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
Graphing Linear Inequalities in Two Variables Chapter 4 – Section 1.
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.
Linear Programming: A Geometric Approach3 Graphing Systems of Linear Inequalities in Two Variables Linear Programming Problems Graphical Solution of Linear.
Linear Programming. Many mathematical models designed to solve problems in business, biology, and economics involve finding the optimum value (maximum.
Word Problems that Lead to Inequalities. Word Problem Solving Strategies Read through the entire problem. Highlight the important information and key.
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.
Unit 1.6 – Linear Programming Ummmmm…yeah…I’m going to need you to go ahead and get out your notes…thanks..
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
Class Schedule: Class Announcements Homework Questions 3.4 Notes Begin Homework.
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.
Linear Programming The Table Method. Objectives and goals Solve linear programming problems using the Table Method.
Chapter 4: Systems of Equations and Inequalities Section 4.7: Solving Linear Systems of 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)
3.4 Linear Programming Solve linear programming problems in two variables using graphical methods.
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-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.
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.
Linear Programming: A Geometric Approach3 Graphing Systems of Linear Inequalities in Two Variables Linear Programming Problems Graphical Solution of Linear.
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-
3.3 Linear Programming.
Digital Lesson Linear Programming.
2-7 Linear Programming Pre Calc A.
Digital Lesson Linear Programming.
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
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.
Warm Up Solve for x:
Systems of Inequalities and Linear Programming
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.
1.6 Linear Programming Pg. 30.
Solve each quadratic using whatever method you choose!
Linear Programming Mr. Carpenter Alg. 2.
Linear Programming.
Presentation transcript:

Applications of Linear Programming Section 3-6 (a.k.a. STORY PROBLEMS)

Review Graph a system of inequalities. Find the vertices of the feasible region. Determine which lines are intersecting. Solve that system of equations. Plug the vertices into the objective function to find the maximum and minimum values.

How will the applications be different? Your problems will be in paragraph form. You will have to create your own system of inequalities. You also get to create your own function.

Not to worry, I have a plan!

Step 1 Define your variables. Look at the last sentence in your problem. Write “x =“ and “y =“ as part of your work.

Step 2 Organize the given information in a chart.

Step 3 Write a system of inequalities to represent all of the limitations. Can the items in my problem be negative? Does the chart show me anything?

Step 4 Graph the system of inequalities and find the vertices of the feasible region.

Step 5 Write a function to be maximized or minimized. Does the chart tell you anything? Often the function represents cost, revenue, or profit.

Step 6 Test your points and answer the question. SENTENCES!!

Sounds easy, ready to try?

The AC Telephone Company manufactures two styles of cordless telephones, deluxe and standard. Each deluxe phone nets the company $9 in profit and each standard phone nets $6. Machines A and B are used to make both styles of telephones. Each deluxe model requires 3 hours of machine A time and 1 hour on B. Each standard phone requires 2 hours on both machines. If the company has 12 hours available on machine A and 8 hours available on B, determine the mix of phones that will maximize the company’s profit.

“determine the mix of phones that will maximize the company’s profit” Let x = # of deluxe phones. Let y = # of standard phones.

Make a chart. Profit Machine A Time Machine B # Deluxe x $9 3 1 # Standard y $6 2 12 8

System of Inequalities Can I make negative phones? Does my table help? x ≥ 0 y ≥ 0 3x + 2y ≤ 12 x + 2y ≤ 8

Graph and find the vertices.

“maximize the company’s profit” P(x, y) = 9x + 6y P(0, 0) = 9(0) + 6(0) = 0 P(0, 4) = 9(0) + 6(4) = 24 P(2, 3) = 9(2) + 6(3) = 36 P(4, 0) = 9(4) + 6(0) = 36

The company should either make 2 deluxe phones and 3 standard phones or 4 deluxe phones and 0 standard phones.

If you are the CEO, which option would you choose? Why?