 Optimizing a function of x and y consists in finding the vertex of a polygon of constraints which, depending on the situation, maximizes or minimizes.

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

2.7 Linear Programming.
Linear Programming Problem
Session II – Introduction to Linear Programming
Standard  MM3A6. Students will solve linear programming problems in two variables.  a. Solve systems of inequalities in two variables, showing the solutions.
Lesson 7.6, page 767 Linear Programming
MTH-5101 Pretest A Solutions
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.
Linear Programming Unit 2, Lesson 4 10/13.
Inequalities Continues
3-5: 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.
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-Up Find all of the possible solutions to the following:
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
Linear Programming David Kauchak cs161 Summer 2009.
Chapter 1 Functions and Their Graphs Graphs of Functions Objectives:  Find the domains and ranges of functions & use the Vertical Line Test for.
Decision Making via Linear Programming: A simple introduction Fred Phillips
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
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.
Linear Programming: A Geometric Approach3 Graphing Systems of Linear Inequalities in Two Variables Linear Programming Problems Graphical Solution of Linear.
Warm-Up Graph the following system of inequalities. Find the coordinates at each vertices.
Copyright © Cengage Learning. All rights reserved. 3 Applications of Differentiation.
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
Get out your Vertices Worksheet!
3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the.
Linear Programming-Bellwork
Chapter 2 Systems of Linear Equations and 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)
Warm Up Graph the following system of inequalities 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-4: Linear Programming Objectives: Standards addressed:
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.
Copyright © 2015 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Section 7.4 Linear Programming Math in Our World.
derivative bears roses A manufacturer has been selling 1000 television sets a week at $450 each. A market survey indicates that for each $10 rebate.
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.
Section 7.5 Linear Programming Math in Our World.
ECONOMIC APPLICATIONS
2.7 Linear Programming Objectives: Use linear programming procedures to solve applications. Recognize situations where exactly one solution to a linear.
3.3 Linear Programming.
LINEARPROGRAMMING 5/23/ :13 AM 5/23/ :13 AM 1.
Digital Lesson Linear Programming.
Systems of Inequalities
Systems of Equations in Three Variables
Digital Lesson Linear Programming.
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
Copyright © Cengage Learning. All rights reserved.
Properties of Parabolas
ALGEBRA II HONORS/GIFTED SECTION 3-4 : LINEAR PROGRAMMING
and Graphing Inequalities
Math3H – Unit 2 Day 3 Linear Programming
Linear Programming Objectives: Set up a Linear Programming Problem
Algebra: Graphs, Functions, and Linear Systems
Objectives Essential Understanding: Some real-world problems involve multiple linear relationships. Linear programming accounts for all of these linear.
Splash Screen.
LESSON 6–5 Linear Optimization.
Chapter 7: Systems of Equations and Inequalities; Matrices
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Applications of Linear Programming
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Warm Up Graph the following inequalities 1) Y > 3x – 2 2) 5y + 4x < 20.
Linear Programming Mr. Carpenter Alg. 2.
Linear Programming.
Presentation transcript:

 Optimizing a function of x and y consists in finding the vertex of a polygon of constraints which, depending on the situation, maximizes or minimizes the function.  In general, we try to maximize a revenue function or minimize a cost function  The optimizing function is in the form: Z = ax + by + c, where a, b and c are numbers

1. Identify the variables 2. Translate the situation into a system of inequalities 3. Graph the polygon of constraints 4. Determine the vertices of the polygon of constraints 5. Establish the rule of the function to be optimized (revenue or cost) 6. Evaluate the function at each of the vertices 7. Deduce the vertex that maximizes or minimizes the function

Ordinary gas sells for 4 ¢ less per litre than super gas at the corner gas station. A litre of super gas costs 83.9 ¢. This gas station sells at least twice as much ordinary gas as super gasoline. The total number of litres of gas sold daily never surpasses 8400, but the station never sells less than 1600 litres of super gas. The following system of inequalities describes the constraints of this situation. x  0 y  0 y  1600 x + y  8400 x  2y where: x represents the number of litres of ordinary gas sold y represents the number of litres of super gas sold. How many litres of each type of gas must be sold daily to maximize income?

400 x  0 y  0 y  1600 x + y  8400 x  2y Vertices: (3200, 1600) (6800, 1600) (5600, 2800) Vertices:Z = 0.799x y (3200, 1600) (6800, 1600) (5600, 2800) Optimizing Function Z = 0.799x y

Example: A steel mill converts steel into girders and rods. The mill can produce at most 100 units of steel a day. At least 20 girders and at least 60 rods are required daily. If the profit on a girder is $8 and the profit on a rod is $6, how many units of each type should the mill produce each day to maximize profits?

Let x = number of girders Let y = number of rods

10 x ≥ 20 y ≥ 60 x + y ≤

Vertices of the polygon: (20, 60) (20, 80) (40, 60) Optimizing Function Z = 8x + 6y

40 girders and 60 rods of steel should be produced for a maximum profit of $680.

The manager of a warehouse store decided to offer his customers two models of a certain heat pump : the Thermex model and the Calorex model. The marketing department gathered the following information : The annual demand for both models will be no more than 300 units. The annual demand for both models will be at least 180 units. A minimum of 100 Thermex models will likely be sold. At most there are 60 more Calorex models than Thermex models in the warehouse. The company makes a profit of $525 on each Thermex model and $700 on each Calorex model. Let x : represent the number of Thermex models sold y : represent the number of Calorex models sold How many heat pumps of each model should be sold in order to maximize the profit?

Constraints y  0 x  0 x + y  300 x + y  180 x  100 y  x + 60

VertexP = 525x + 700y (180, 0) (100, 80) (100, 160) (120, 180) (300, 0)

The student council of a school is organizing a fashion show, which will be held in the school auditorium. The tickets will cost $4 for students at the school and $6 for the general public. The following polygon of constraints reflects the different constraints faced by the student council. x: number of tickets for students at the school y: number of tickets for the general public A runway will be built so that the models can walk down the middle of the auditorium. The runway will reduce the seating capacity. As a result, only a maximum of 240 tickets can be sold. By how much will the maximum possible revenue decrease once the runway is built?

VertexRevenue: 4x + 6y P(60, 60) Q(150, 150) R(240, 60) $600 $1500 $1320 Maximum revenue before the runway is built x + y  240 Additional constraint

VertexRevenue: 4x + 6y (60, 60) (120, 120) (180, 60) $600 $1200 $1080 Maximum revenue after the runway is built Decrease in maximum revenue: $1500  $1200 = $300

Oliver works as a cashier and wrapper at a grocery store. There are different constraints that limit the number of hours he can work per week. These constraints are represented by the inequalities and the polygon of constraints given below. Each side of the polygon and its corresponding inequality are identified by the same number.  y  4  x + y  16  y  4 + 2x  x  1 x: number of hours he can work per week as a cashier y: number of hours he can work per week as a wrapper Oliver's boss suggests two ways of paying him: Option A: $13 per hour as a cashier and $8 an hour as a wrapper; Option B: $9 per hour, whether he works as a cashier or as a wrapper. Which option will allow Oliver to maximize his income?

Income Vertices Option A 13x + 8y Option B 9x + 9y P(1, 4)45 Q(1, 6)6163 R(4, 12) S(12, 4)188144