Systems of Inequalities

Slides:



Advertisements
Similar presentations
3.4 Linear Programming 10/31/2008. Optimization: finding the solution that is either a minimum or maximum.
Advertisements

LIAL HORNSBY SCHNEIDER
1. Vertex 2. Fundamental Theorem of Linear Programming 3. Linear Programming Steps 1.
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
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.
1 © 2010 Pearson Education, Inc. All rights reserved © 2010 Pearson Education, Inc. All rights reserved Chapter 8 Systems of Equations and Inequalities.
Linear Programming Unit 2, Lesson 4 10/13.
Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem.
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
Determine if the given ordered pair is a solution of
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
3.4 Linear Programming p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
Objective Vocabulary Solve linear programming problems.
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.
Systems of Inequalities in Two Variables Sec. 7.5a.
Linear Programming: A Geometric Approach3 Graphing Systems of Linear Inequalities in Two Variables Linear Programming Problems Graphical Solution of Linear.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 5 Systems and Matrices Copyright © 2013, 2009, 2005 Pearson Education, Inc.
3.5 Linear Programming Warm-up (IN) 1. Solve the system: (5, 2)
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
11C. Linear Programming. What is a linear programming problem? 1.A set of variables (in Further Maths there will only ever be two variables) called decision.
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
Linear Programming Advanced Math Topics Mrs. Mongold.
Class Schedule: Class Announcements Homework Questions 3.4 Notes Begin Homework.
Linear Programming 1.4 Algebra II.
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:
December 4, 2015 Hanging with Harvard 4 L INEAR P ROGRAMMING.
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.
1 What you will learn  Lots of vocabulary!  How to find the maximum and minimum value of a function given a set of “rules”
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.
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.
October 18 and 19.
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.
2-7 Linear Programming Pre Calc A.
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
Copyright © Cengage Learning. All rights reserved.
ALGEBRA II HONORS/GIFTED SECTION 3-4 : LINEAR PROGRAMMING
Linear Systems Chapter 3.
Linear Programming Skill 45.
3-3 Optimization with Linear Programming
and Graphing Inequalities
Linear Programming.
Math3H – Unit 2 Day 3 Linear Programming
Linear Programming Objectives: Set up a Linear Programming Problem
Objective Vocabulary Solve linear programming problems.
3.4b: Linear Programming ~ Application
Warm Up Solve for x:
Linear Programming Example: Maximize x + y x and y are called
Graphical Solution of Linear Programming Problems
Systems of Inequalities and Linear Programming
Systems of Inequalities. Linear Programming
Chapter 7: Systems of Equations and Inequalities; Matrices
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.
Section Linear Programming
1.6 Linear Programming Pg. 30.
Linear Programming.
Section – Linear Programming
Section 7.5 Linear Programming.
Presentation transcript:

Systems of Inequalities We are going to sketch inequalities (<, >, ≤, ≥) the same way we did before...with a test point Ex. Sketch y ≥ x2 – 1 1 1

Ex. Sketch the graph of x – y < 2

Ex. Sketch the graph of y ≤ 3

Ex. Sketch the graph of x > -2

The solution of a system of inequalities is a graph of all points that satisfy each inequality Ex. Sketch the graph, and label the vertices, of the solution set of the system

Ex. Sketch the solution set of the system

Ex. Sketch the solution set of the system

Ex. Sketch the solution set of the system

Ex. You plan to invest up to $20,000 in two different accounts, with each account containing at least $5000. Also, the amount in Account A should have at least twice the amount in Account B. Find and graph a system of inequalities that demonstrates this situation.

Ex. The liquid portion of a diet must provide at least 300 calories, 36 units of vitamin A, and 90 units of vitamin C. A cup of drink X has 60 calories, 12 units of vitamin A, and 10 units of vitamin C. A cup of drink Y has 60 calories, 6 units of vitamin A, and 30 units of vitamin C. Set up and graph a system of inequalities that shows how many cups of each drink would meet or exceed the minimum requirements.

Practice Problems Section 6.5 Problems 1, 3, 9, 35, 37, 39, 41, 69 11

Linear Programming An optimization problem involves: a value to be maximized (or minimized), called the objective function restrictions on the variables in the objective function, called the constraints The constraints are a system of inequalites like we saw earlier, and the solution graph shows all feasible solutions The maximum and minimum values of the objective function will occur at a vertex of the shaded region 12 12

Ex. Find the maximum value of z = 3x + 2y subject to the constraints

Ex. Find the minimum value of z = 5x + 7y subject to the constraints

It is possible that the maximum will occur at more than one vertex - If this happens, this maximum will also occur at every point on the line connecting these vertices

Ex. Find the minimum value of z = 4x + 2y subject to the constraints

Ex. A manufacturer is making two types of candy, chocolate creams that net $1.50 and chocolate nuts that net $2.00, and wants to maximize profit. Market tests and available resources create the following constraints: The combined number of boxes should not exceed 1200 The demand for chocolate nuts is no more than half the demand for chocolate creams The number of chocolate cream boxes is no more than 600 plus three times the number of chocolate nuts

Ex. The liquid portion of a diet must provide at least 300 calories, 36 units of vitamin A, and 90 units of vitamin C. A cup of drink X has 60 calories, 12 units of vitamin A, and 10 units of vitamin C. A cup of drink Y has 60 calories, 6 units of vitamin A, and 30 units of vitamin C. If drink X costs $0.12 and drink Y costs $0.15, how many cups of each drink must be consumed to obtain optimal cost and still meet the minimum requirements?

Practice Problems Section 6.6 Problems 5, 13, 15, 17, 41, 43 23 23