Warm-Up Graph the following system of inequalities. Find the coordinates at each vertices.

Slides:



Advertisements
Similar presentations
3.4 Linear Programming.
Advertisements

Standard  MM3A6. Students will solve linear programming problems in two variables.  a. Solve systems of inequalities in two variables, showing the solutions.
Linear Programming 1.6 (M3) p. 30 Test Friday !!.
S EPTEMBER 14, L INEAR P ROGRAMMING Linear programming = a process of maximizing a linear objective function Objective function = gives a quantity.
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.
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. Learning Targets  I can solve systems of inequalities by graphing.  I can determine the coordinates of the vertices of a region formed by.
Linear Programming Objective: I can solve problems using linear programming.
3.5 Linear Programming Objectives: Write and graph a set of constraints for a linear-programming problem. Use 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.
Graphing Linear Inequalities in Two Variables Chapter 4 – Section 1.
Solve problems by using linear programming.
Unit 1.6 – 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 Cont. Warm-up (IN) Learning Objective: to continue linear programming 1. Solve the system: 2. Graph the feasible region and list the coordinates of.
Linear Programming: A Geometric Approach3 Graphing Systems of Linear Inequalities in Two Variables Linear Programming Problems Graphical Solution of Linear.
3.5 Linear Programming Warm-up (IN) 1. Solve the system: (5, 2)
Linear Programming Problem. Definition A linear programming problem is the problem of optimizing (maximizing or minimizing) a linear function (a function.
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
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  A.  B.  C.  D.. Homework Questions from Last night?
Warm-up Solve each system of equations:
Get out your Vertices Worksheet!
Linear Programming. Graph the following system of inequalities.
Review Homework Page Rocket City Math League There are five levels of three rounds of individual testing that range from Pre-Algebra to Calculus,
3-4 Linear Programming (p. 139) Algebra 2 Prentice Hall, 2007.
Constraints Feasible region Bounded/ unbound Vertices
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.
Greater than or equal to Less than or equal to Greater than Less than Warm Up Copy and fill in the chart. SituationInequality Practice more than an hour.
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”
3-4: Linear Programming Objectives: Standards addressed:
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.
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.
Chapter 3 Section 4 Linear Programming Algebra 2 January 29, 2009.
1. What does a need to be if there were infinitely many solutions to the system of equations. y + 2x = 12 2y + 4x = 2a.
Section 3.5 Linear Programing In Two Variables. Optimization Example Soup Cans (Packaging) Maximize: Volume Minimize: Material Sales Profit Cost When.
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.
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.
Digital Lesson Linear Programming.
Digital Lesson Linear Programming.
Ch. 3.4 I can solve problems using linear programming
9/8/16 In solving a system of equations, when will your answer be “no solution”? Identify the slope and y-intercept: 2
ALGEBRA II HONORS/GIFTED SECTION 3-4 : LINEAR PROGRAMMING
3.2 Linear Programming 3 Credits AS
3-3 Optimization with Linear Programming
and Graphing Inequalities
Linear Programming.
3.4 – Linear Programming.
8.4 Linear Programming p
LESSON 6–5 Linear Optimization.
Systems of Inequalities. Linear Programming
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.
Presentation transcript:

Warm-Up Graph the following system of inequalities. Find the coordinates at each vertices.

Linear Programming Test: Oct. 30

Vocabulary Linear programming: maximizing/minimizing a linear objective function. Objective function: gives quantity that is to maximized or minimized and subject to constraints Constraints: boundaries of a function Feasible region: solution area shaded when all constraints are graphed –If bounded (definite shape) then it has a max./min. –The max./min are the vertices.

Find the minimum value and the maximum value of the objective function C=3x+2y subject to the following constraints.

Find the minimum value and the maximum value of the objective function C= 4x + 3y subject to the following constraints. Min.: 0 Max.: 32

Find the minimum value and the maximum value of the objective function C= 7x + 5y subject to the following constraints. Min.: 14, Max.: 44

Find the minimum value and the maximum value of the objective function C= 2x + 8y subject to the following constraints. Min.: 0, Max.: 56

Linear Programming *Word Problems* Test: FRIDAY!

A small company produces knitted afghans and sweaters and sells them through a chain of specialty stores. The company is to supply the stores with a total of no more than 100 afghans and sweaters per day. The stores guarantee that they will sell at least 10 and no more than 60 afghans per day and at least 20 sweaters per day. The company makes a profit of $10 on each afghan and a profit of $12 of each sweater. How many of each should they provide to maximize their profit?

You are taking a test in which items of type A are worth 10 points and items of type B are worth 15 points. It takes 3 minutes to answer each item of type A and 6 minutes for each item of type B. The total time allowed is 60 minutes, and you may not answer more than 16 questions. Assuming all of your answers are correct, how many items of each should you answer to get the highest score?

A man plans to invest up to $22,000 in bank X or bank Y, or both. He will invest at least $2000, but no more than $14,000, in bank X. He will invest no more than $15,000 in bank Y. Bank X pays 6% simple interest, and bank Y pays 6.5%. How much should he invest in each to maximize income? What is the maximum income?

Homework Wagons are sold at a craft fair. It takes 4 hours to make a small one and 6 hours to make a large one. The owner will make a profit of $12 for a small wagon and $20 for a large one. He has no more than 60 hours available to make the wagons and wants to have at least 6 small wagons to sell. How many of each size should be made to maximize the profit?