Linear Programming. Graph the following system of inequalities.

Slides:



Advertisements
Similar presentations
2.7 Linear Programming.
Advertisements

3.4 Linear Programming.
3 – 4 Linear Programming Word Problems
Assignment 2 Question 7 Farmer Leary.
Standard  MM3A6. Students will solve linear programming problems in two variables.  a. Solve systems of inequalities in two variables, showing the solutions.
S EPTEMBER 14, L INEAR P ROGRAMMING Linear programming = a process of maximizing a linear objective function Objective function = gives a quantity.
Linear Programming Unit 2, Lesson 4 10/13.
3.4 Linear Programming.
3-5: Linear Programming.
SECTION 3.4 Systems of Linear Inequalities. Warm Up 1.Graph y < -x +12. Graph the system.
Warm - Up. Learning Targets  I can solve systems of inequalities by graphing.  I can determine the coordinates of the vertices of a region formed by.
3.5 Linear Programming Objectives: Write and graph a set of constraints for a linear-programming problem. Use linear programming.
Objective Function: Vertices (x, y)Work - plug into p(x, y)Solution Analysis: Constraints: _________________________.
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.
P I can solve linear programing problem. Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
Linear Programming. What is Linear Programming? Say you own a 500 square acre farm. On this farm you can grow wheat, barley, corn or some combination.
Linear Programming 1.3 M Warm-Up Graph the system.
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.
3.5 Linear Programming Warm-up (IN) 1. Solve the system: (5, 2)
Warm-Up Graph the following system of inequalities. Find the coordinates at each vertices.
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
11/20/2015 6:37 AM1 1 LINEAR PROGRAMMING Section 3.4, ©2008.
B RIEF C ALC – S EM 1 R EVIEW C H 1 Formulas: Three forms of Linear Equations Standard: Ax + By = C “A” and “ B ” must be a whole numbers “A” must be positive.
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. Ex. 1 Graph the system of inequalities. Name the coordinates of the vertices of the feasible region. Find the max & min values.
3.4: Linear Programming Objectives: Students will be able to… Use linear inequalities to optimize the value of some quantity To solve linear programming.
Warm-up Solve each system of equations:
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.
Constraints Feasible region Bounded/ unbound Vertices
Chapter 2 Systems of Linear Equations and Inequalities.
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 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Warm Up Graph the following system of inequalities Y > 3x – 2 5y + 4x < 20.
SYSTEMS OF EQUATIONS. Unit 2 Systems of Equations A system of equations is two or more equations with the same variables. ex. 3x-2y=8 4x+3y=12 There are.
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.3 Linear Programming. Vocabulary Constraints: linear inequalities; boundary lines Objective Function: Equation in standard form used to determine the.
1. Solve this system and find the product of its solutions. x + y = 7 2x – y =8 2. The feasible region for a set of constraints has vertices (2,0), (8,2)
1. What does a need to be if there were infinitely many solutions to the system of equations. y + 2x = 12 2y + 4x = 2a.
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.
Linear Programming Chapter 3 Lesson 4 Vocabulary Constraints- Conditions given to variables, often expressed as linear inequalities. Feasible Region-
SYSTEMS OF EQUATIONS.
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.
3-3 Linear Programming.
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
9/8/16 In solving a system of equations, when will your answer be “no solution”? Identify the slope and y-intercept: 2
3.2 Linear Programming 3 Credits AS
3-3 Optimization with Linear Programming
Linear Programming.
3.4 – Linear Programming.
Objectives Essential Understanding: Some real-world problems involve multiple linear relationships. Linear programming accounts for all of these linear.
8.4 Linear Programming p
Graphing Systems of Linear Inequalities
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.
1.6 Linear Programming Pg. 30.
Linear Programming 1.3 M3.
Linear Programming Mr. Carpenter Alg. 2.
Linear Programming.
Presentation transcript:

Linear Programming

Graph the following system of inequalities

Graph the system

Another example

Graphing Inequalities

More graphing...

Linear Programming A method used to find optimal solutions such as maximum or minimum profits Steps: 1.Assign variables 2.Determine the constraints (inequalities) 3.Find the feasible region (area of solution) 4.Determine the vertices of feasible region 5.Plug those values into the profit equation(also called objective function)

Finding Max or Min

Example Mr. Farmer wants to plant some corn and wheat and he gets the following statistics from the US Bureau of Census CropYield per acreAvg Price Corn113.5 bu$3.15/bu Soybeans34.9 bu$6.80 bu Wheat35.8 bu$4.45 bu Cotton540 lb$0.759/lb Rice, rough5621 lb$0.0865/lb

Example continued Mr. Farmer can have no more 120 acres of corn and wheat At least 20 and no more than 80 acres of corn At least 30 acres of wheat How many acres of each crop should Mr. Farmer plant to maximize the revenue from his harvest?

Working through the problem.. Assign Variables X=acres of corn and y=acres of wheat List the constraints

Graph it

Example continued List the vertices Determine Profit equation Which would yield the most?

Another Ex. A snack bar cooks and sells hamburgers and hot dogs during football games. To stay in business, it must sell at least 10 hamburgers but cannot cook more than 40. It must also sell at least 30 hot dogs but cannot cook more than 70. The snack bar cannot cook more than 90 items total. The profit on a hamburger is $0.33 and on a hot dog it is $0.21. How many of each item should it sell to make the maximum profit? Profit Equation: __________________________ Constraints: Answer: _________________________

Another Example As a receptionist for a veterinarian, Sue scheduled appointments. She allots 20 minutes for a routine office visit and 40 minutes for surgery. The vet can not do more than 6 surgeries per day. The office has 7 hours available for appointments. If an office visits costs $55 and most surgeries costs $125, find a combination of office visits and surgeries that will maximize the income the veterinarian practice receives per day.

What do you know… Assign variables x=number of office visits y=number of surgeries Constraints: 7 hours needs to be in terms of minutes

Continued… Graph and determine coordinates of the vertices You should get (0,0) (0,6)(9,6)(21,0)

Continued…. Determine the profit equation $55v + $125s = P Test the points Highest profit would be when there are 6 surgeries and 9 visits