1.05 Polygon of Constraints

Slides:



Advertisements
Similar presentations
Solve the system of inequalities by graphing. x ≤ – 2 y > 3
Advertisements

3.4 Linear Programming.
3-3 Solving Systems of Inequalities by Graphing
Ch 2. 6 – Solving Systems of Linear Inequalities & Ch 2
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.
Essential Question: How do you solve a system of inequalities by graphing?
Systems of Linear Inequalities.  Two or more linear inequalities together form a system of linear inequalities.
Chapter 5 Linear Inequalities and Linear Programming Section 2 Systems of Linear Inequalities in Two Variables.
Splash Screen. Lesson Menu Five-Minute Check (over Lesson 3–2) CCSS Then/Now New Vocabulary Key Concept: Feasible Regions Example 1: Bounded Region Example.
Warm-up Follows….. 5-Minute Check 4 A.(0, 3), (0, 6), (2, 12) B.(0, 0), (0, 3), (0, 6), (2, 3) C.(0, 0), (0, 3), (2, 3), (3, 2) D.(0, 0), (0, 3), (2,
Splash Screen. Then/Now You solved systems of linear inequalities by graphing. Find the maximum and minimum values of a function over a region. Solve.
3.3 Graphing Systems of Inequalities. Steps to Graphing a System of Inequalities. 1) Graph each inequality with out shading the region. 2) Find the region.
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.
2.6 Linear Inequalities in Two Variables
3.4 Linear Programming p Optimization - 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.
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)
Set Operations and Compound Inequalities. 1. Use A = {2, 3, 4, 5, 6}, B = {1, 3, 5, 7, 9}, and C = {2, 4, 6, 8} to find each set.
Notes 7.5 – Systems of Inequalities. I. Half-Planes A.) Given the inequality, the line is the boundary, and the half- plane “below” the boundary is the.
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
Class Schedule: Class Announcements Homework Questions 3.4 Notes Begin Homework.
1.7 Linear Inequalities.  With an inequality, you are finding all values of x for which the inequality is true.  Such values are solutions and are said.
3.4: Linear Programming Objectives: Students will be able to… Use linear inequalities to optimize the value of some quantity To solve linear programming.
Essential Question: How do you solve a system of inequalities by graphing?
Healthy Animals Curtis is concerned about the
Get out your Vertices Worksheet!
Grace enjoys baby-sitting, but it only pays $4 an hour. She has been offered a job as a tutor that pays $8 an hour. She can must work less than 15 hours.
Constraints Feasible region Bounded/ unbound Vertices
Chapter 4: Systems of Equations and Inequalities Section 4.7: Solving Linear Systems of Inequalities.
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.4: Linear Programming  Intro: Oftentimes we want to optimize a situation - this means to:  find a maximum value (such as maximizing profits)  find.
3-5: Linear Programming. Learning Target I can solve linear programing problem.
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.
Splash Screen. Lesson Menu Five-Minute Check (over Lesson 3–2) CCSS Then/Now New Vocabulary Key Concept: Feasible Regions Example 1: Bounded Region Example.
Unit 1: Linear Functions and Inequalities Day 4:Linear Inequalities.
Section 3-3: Graphing Inequalities Pages in textbooks.
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 A-CED.3 REPRESENT CONSTRAINTS BY EQUATIONS OR INEQUALITIES, AND BY SYSTEMS OF EQUATIONS AND/OR INEQUALITIES, AND INTERPRET SOLUTIONS.
3.3 Solving Systems of Inequalities by graphing. Main Ideas Solve systems of inequalities by graphing. Determine the coordinates of the vertices of a region.
Linear Programming Chapter 3 Lesson 4 Vocabulary Constraints- Conditions given to variables, often expressed as linear inequalities. Feasible Region-
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.
Optimization with Linear Programming
Systems of Inequalities
Chapter 5 Linear Inequalities and Linear Programming
Warm – up Solve each equation for y then graph. 2x + y = 5 2y – x = 6
Systems of Equations and Inequalities
Copyright © Cengage Learning. All rights reserved.
Model contexts graphically using a system of inequalities
Splash Screen.
3.2 Linear Programming 3 Credits AS
Warm Up Is (4,2) a solution to the system Y > 3x – 2 5y + 4x < 20.
3-3 Optimization with Linear Programming
Linear Programming.
Optimization with Linear Programming
Solve the system of inequalities by graphing. x ≤ 2 y > 3
8.4 Linear Programming p
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
LESSON 6–5 Linear Optimization.
Day 74 Inequalities problem solving
Polygon of constraints L.O. graph the polygon of constraints
Section Linear Programming
4-1 to 4-3 One-Step Inequalities
1.6 Linear Programming Pg. 30.
Warmups October 6-10, 2014.
Presentation transcript:

1.05 Polygon of Constraints Unit: Optimization

Brainstorm: What does it mean? POLYGON CONSTRAINTS 𝒐𝒇

Systems to Polygon of Constraints We have been studying Systems of Inequalities. You needed to know the difference: Graphing vs Solving You have encountered two types of Systems: Unbounded Bounded

Unbounded 𝑦<−2𝑥+7 𝑦≥𝑥−3 𝑥<1 𝑦<−2𝑥+7 𝑦≥𝑥−3 𝑥<1 The shading would continue on forever to the left This is NOT a Polygon of Constraints

bounded 𝑦<5 𝑥≥−2 𝑦> 4 3 𝑥−3 1 bounded 𝑦<5 𝑥≥−2 𝑦> 4 3 𝑥−3 The shading is contained to a specific region by the inequalities This IS a Polygon of Constraints

Polygon of Constraints: Process Words to Rules SOLVE the System Graph the boundary lines of the inequalities Shade the solution set Solve the Vertices (POIs of the Polygon)

The Purpose To find all the possible solutions (points) that would be feasible for a situation that involves boundaries. Best understood if explored with the real life question.

Pet-Care Sandra and Jane want to open a pet spa. They will offer two services: PET BATHS and PET-iCURES They have conducted market research and found the following: A PET BATH takes 2 hours and a PET-iCURE takes 1 hour They will never do a negative amount of PET BATHS They are guaranteed to do at least 2 PET-iCURES a day They plan on opening their store for 8 hours a day They charge $40 per PET BATHS and $10 per PET-iCURES

Polygon Process Words to Rules 𝑥=PET−iCURES 𝑦=PET BATHS Polygon Process Words to Rules A PET BATH takes 2 hours and a PET-iCURE takes 1 hour They will never do a negative amount of PET BATHS They are guaranteed to do at least 2 PET-iCURES a day They plan on opening their store for 8 hours a day They charge $40 per PET BATHS and $10 per PET-iCURES

Words to Rules 𝑦>0 𝑥≥2 𝑥+2𝑦≤8 1 Polygon Process Words to Rules 𝑦>0 𝑥≥2 𝑥+2𝑦≤8 SOLVE the System Graph the boundary lines of the inequalities Shade the solution set Solve the Vertices (POIs of the Polygon)

Context Questions Can you give partial Baths/Pet-icures and still get paid? What are all the possible combinations of PET-iCURES and BATHS they could give in a day? 𝑥=PET−iCURES 𝑦=PET BATHS 2,0 6,0 3,1 2,2 3,0 7,0 4,1 3,2 4,0 8,0 5,1 4,2 5,0 2,1 6,1 2,3

The last Rule They charge $40 per PET BATHS and $10 per PET-iCURES 40𝑦+10𝑥=𝑅𝐸𝑉𝐸𝑁𝑈𝐸 Find all the possible revenues the girls could make 2,0 6,0 3,1 2,2 $70 $20 $60 $100 3,0 7,0 4,1 3,2 $30 $70 $80 $110 4,0 8,0 5,1 4,2 $40 $80 $90 $120 5,0 2,1 6,1 2,3 $60 $100 $50 $140

The Best options are the vertices! Notice The Best options are the vertices! Are our vertices Feasible?

Same slide as before Purpose To find all the possible solutions (points) that would be feasible for a situation that involves boundaries.

Challenge Question Tomorrow Quiz Wednesday (Practice Quiz) Practice Today: Visions Page 30 #1-3 Tomorrow: Visions Page 30 #4-6, 8, 9, 11 (TWO DAYS) Quiz Wednesday