A Linear Programming Problem A funfair car park is being designed. It can hold cars and minibuses. A parking bay for a car takes up 15m 2, while that for.

Slides:



Advertisements
Similar presentations
Linear Systems Chapter 3 – Algebra 2.
Advertisements

Objective 3-4 Linear Programming Solve linear programming problems.
Example 1 Define the Variables: Let l = length of package g = girth of package Two variables – two inequalities: Graph each inequality. Don’t forget to.
Linear Programming Unit 2, Lesson 4 10/13.
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.
Systems of Linear Inequalities.  Two or more linear inequalities together form a system of linear inequalities.
3.4 Review of Linear Programming
3.3 Linear Inequalities in Two Variables Objectives: Solve and graph a linear inequality in two variables. Use a linear inequality in two variables to.
Determine if the given ordered pair is a solution of
3.3 Systems of Linear Inequalities -graphing -linear programming
Objective Vocabulary Solve linear programming problems.
Linear Inequalities and Linear Programming Learning Outcomes  I can solve a linear inequality  I can graph a linear inequality  I can find the region.
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.
Linear Inequalities in Two Variables Objectives: Solve and graph a linear inequality in two variables..
3.5 Linear Programming Warm-up (IN) 1. Solve the system: (5, 2)
Linear Optimisation. A video chain has been conducting research for a new outlet. The outlet can stock old classic films only, new releases only, or a.
A factory produces two types of drink, an ‘energy’ drink and a ‘refresher’ drink. The day’s output is to be planned. Each drink requires syrup, vitamin.
3.4 – Linear Programming. Ex. 1 Graph the system of inequalities. Name the coordinates of the vertices of the feasible region. Find the max & min values.
Class Opener: Solve each equation for Y: 1.3x + y = y = 2x 3.x + 2y = 5 4. x – y = x + 3y = x – 5y = -3.
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.
x y Example 1 x y X = 3.
Constraints Feasible region Bounded/ unbound Vertices
Warm Up Graph the following system of inequalities Y > 3x – 2 5y + 4x < 20.
3-4: Linear Programming Objectives: Standards addressed:
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.
Graphing Linear Inequations y > y is greater than  all points above the line are a solution y < y is less than  all points below the line are a solution.
THE PROBLEM – Method 1 Linear Programming : Introductory Example Let x represent number of litres of energy drink Let y represent number of litres of refresher.
LINEAR PROGRAMMING A-CED.3 REPRESENT CONSTRAINTS BY EQUATIONS OR INEQUALITIES, AND BY SYSTEMS OF EQUATIONS AND/OR INEQUALITIES, AND INTERPRET SOLUTIONS.
LOOKING FOR THE OVERLAP SOLVING SYSTEMS OF INEQUALITIES.
Linear Programming Chapter 3 Lesson 4 Vocabulary Constraints- Conditions given to variables, often expressed as linear inequalities. Feasible Region-
Chapter 9: Systems of Equations and Inequalities; Matrices
GENERAL MATHS – UNIT TWO
October 18 and 19.
3.3 Linear Programming.
Digital Lesson Linear Programming.
Linear Programming : Introductory Example
Linear Programming.
Digital Lesson Linear Programming.
Graph Inequalities On Coordinate Plane
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
Graphing Systems of Inequalities.
GENERAL MATHS – UNIT TWO
Graph Inequalities On Coordinate Plane
ALGEBRA II HONORS/GIFTED SECTION 3-4 : LINEAR PROGRAMMING
Section 7-5: Linear Inequalities
3.2 Linear Programming 3 Credits AS
GENERAL MATHS – UNIT TWO
Linear Inequalities and Systems of Linear Inequalities
3-3 Optimization with Linear Programming
Linear Programming.
Linear Programming Objectives: Set up a Linear Programming Problem
Do Now! Solve the system of equations Do all work on the notecard.
Objective Vocabulary Solve linear programming problems.
Special Graphs of Inequalities.
Special Graphs of Inequalities.
Graphing Systems of Linear Inequalities
Graphing Systems of Linear Inequalities
Applications of Linear Programming
Review Graphing Linear Equations
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Linear Inequalities and Systems of Linear Inequalities
Special Graphs of Inequalities.
Y x
Section Linear Programming
1.6 Linear Programming Pg. 30.
Presentation transcript:

A Linear Programming Problem A funfair car park is being designed. It can hold cars and minibuses. A parking bay for a car takes up 15m 2, while that for a minibus takes up 24m 2 The car park has a total available area of 1ha (i.e m 2 ) The car park must reserve space for a minimum of 100 minibuses There must be spaces for at least three times as many cars as for minibuses The cost of parking a car for an hour is $20, while it is $40 for a minibus. Here is some information regarding the parking bays:. What combination of bays for cars and bays for buses maximises income?

Step 1 – express the constraints as inequalities Let x be the number of bays for cars, y the number for minbuses Each car needs 15m 2, so x cars need 15x m 2 Similarly y minibuses need 24y m 2 So 15x + 24y < “Reserve space for a minimum of 100 minibuses”So y > 100 “Need spaces for at least three times as many cars as for minibuses” So x > 3y “The car park has a total available area of 10000m 2 ”

Step 2 – Graph the inequalities Remember – we start by drawing lines. And in this problem the lines we shall draw will be: 15x + 24y = y = 100 and x = 3y This line has intercepts: (0, 416.7) and (666.7, 0) This is a horizontal line through (0, 100) This line goes through: (0, 0) and (600, 200)

The lines Here are the lines y x O y=1/3x x + 24y = y=

The feasible region left unshaded y x O Remember – we take “test” points off the line. If the coordinates of these points don’t satisfy the inequality, we shade all of that region in.

The Profit line is added, them moved y x O $20 per car, $40 per bus, so the income is 20x + 40y Draw the line P = 20x + 40y (this is actually a family of lines) The line 4000 = 20x + 40y is drawn Now the line 8000 = 20x + 40y The greater we make P, the further the Profit line moves We make P as big as possible – until it is just about to leave the feasible region

We solve the problem y x O We find the x and y coordinates of the final lattice point the profit line hits, just before it leaves the feasible region In this case it’s (434, 144) So the maximum income is: $(434x20) + $(144 x 40) =$14440