Objective Function: Vertices (x, y)Work - plug into p(x, y)Solution Analysis: Constraints: _________________________.

Slides:



Advertisements
Similar presentations
2.7 Linear Programming.
Advertisements

3 – 4 Linear Programming Word Problems
LIAL HORNSBY SCHNEIDER
Linear Programming Problem
Standard  MM3A6. Students will solve linear programming problems in two variables.  a. Solve systems of inequalities in two variables, showing the solutions.
Chapter 5 Linear Inequalities and Linear Programming
5.2 Linear Programming in two dimensions: a geometric approach In this section, we will explore applications which utilize the graph of a system of linear.
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ Linear Programming in two dimensions:
Learning Objectives for Section 5.3
Chapter 5 Linear Inequalities and Linear Programming Section 3 Linear Programming in Two Dimensions: A Geometric Approach.
Linear Programming Pre-Calc Section 3.4 Running a profitable business requires a careful balancing of resources (for example, peoples’ time, materials,
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
Linear Programming Unit 2, Lesson 4 10/13.
3.4 Linear Programming.
3-5: Linear Programming.
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.
Systems. Day 1 Systems of Linear Equations System of Linear Equations: two or more linear equations together The solution of the system of equations.
3.4 Review of Linear Programming
Determine if the given ordered pair is a solution of
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.
Chapter 12 Section 12.1 The Geometry of Linear Programming.
3.3 Systems of Linear Inequalities -graphing -linear programming
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
P I can solve linear programing problem. Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
Objective Vocabulary Solve linear programming problems.
Warm up  Write the equation of a quadratic function with a vertical compression of 0.2 that is shifted left 1 and up 7.  At a clothing store, shirts.
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.
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.
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
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:
Get out your Vertices Worksheet!
Linear Programming. Graph the following system of inequalities.
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.
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)
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:
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.
Linear Programming: A Geometric Approach3 Graphing Systems of Linear Inequalities in Two Variables Linear Programming Problems Graphical Solution of Linear.
Copyright © 2015 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Section 7.4 Linear Programming Math in Our World.
Section 7.5 Linear Programming Math in Our World.
GENERAL MATHS – UNIT TWO
2.7 Linear Programming Objectives: Use linear programming procedures to solve applications. Recognize situations where exactly one solution to a linear.
LINEARPROGRAMMING 5/23/ :13 AM 5/23/ :13 AM 1.
Chapter 5 Linear Inequalities and Linear Programming
Systems of Equations and Inequalities
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
ALGEBRA II HONORS/GIFTED SECTION 3-4 : 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.
Factor as many polynomials as you can.
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.
10.8 Linear Programming.
Section Linear Programming
Linear Programming Mr. Carpenter Alg. 2.
Presentation transcript:

Objective Function: Vertices (x, y)Work - plug into p(x, y)Solution Analysis: Constraints: _________________________

Objective Function: Paid is p(x, y) = 3x + 5y Vertices (x, y)Work - plug into p(x, y)Solution (0, 0)3(0) + 5(0)0 (4, 5)3(4) + 5(5)37 (25, 0)3(25) + 5(0)75 Analysis: The maximum amount paid occurs when there are 25 callers & no advertisements. Constraints: Boots Unplugged: Mrs. Boots runs a radio show. She gets paid $3 for each caller (x) and $5 for each advertisement (y). She cannot have a negative number of callers, however the number of callers must be greater than the number of advertisements minus one. She cannot have a negative number of advertisements, however they must be less than -1/4 times the number of callers plus six. Number of callers Number of advertisements (0,1) (4,5) (25,0)

Steps 1.Write your problem statement containing limits. 2.Write an inequality for each constraint. 3.Determine the quantity to be maximized or minimized and write the P(x,y) function. This is called the objective function. 4.Label each axis and graph each function. All four constraint equations are graphed on the same coordinate plane. Remember the graphing process is the same as graphing a line in y = mx + b form, only has a dashed line. For shading, is up (or right). 5.The feasible region is the area shaded by all four constraints. Darken this area which represents the system of possible answers. 6.Identify the vertices or corners of the feasible region. Write these points (where the constraints intersect) in the table. 7.Evaluate the objective function for each vertex. 8.From the results determine the maximum or minimum and the conditions by which it occurs. Write a statement containing your answer.

SmartCars A company manufactures bolts for Fords & bolts for SmartCars. One machine can produce no more than 70 Ford fender bolts daily and another machine can produce a maximum of 50 SmartCar bumper bolts. The combined number of fender bolts and bumper bolts that the packaging department can handle is 90 daily. How many of each type of bolts should the company manufacture for maximum daily income if the SmartCar bumper bolts sell for $6 and the Ford fender bolts sell for $4? What is the maximum daily income? Graph constraints to find the corners Plug corners (x,y) in this equation to find profit.

Wheel Cycle Co. The Wheel Cycle Co. manufactures motorcycles & bicycles. To stay in business it must produce at least 10 motorcycles each month, but it does not have the facilities to produce more than 60. It also does not have the facilities to produce more than 120 bicycles. The total production cannot exceed 160. The profit on a motorcycle is $134 & on a bicycle $20. Find the number of each that must be produced to achieve a maximum profit. Graph constraints to find the corners Plug corners (x,y) in this equation to find profit.

Carpenter A carpenter makes bookcases in two sizes, large & small. It takes about 6 hours to make a large bookcase & 2 hours to make a small one. The profit on a large bookcase is $50 and the profit on a small one is $20. The carpenter can only spend 24 hours a week making bookcases and must make at least 2 of each size. How many of each must be made per week to achieve a maximum profit? What will the profit be? Graph constraints to find the corners Plug corners (x,y) in this equation to find profit.

Salon The Cutting Edge Salon schedules appointments for 30 minutes haircuts and 1 hour for highlights. Each haircut costs $20 & highlights cost $45. The salon wants to schedule no more than 4 highlights per day and at least 3 haircuts. Find the number of appointments that produces the maximum income for a stylist in an 8 hour workday. Graph constraints to find the corners Plug corners (x,y) in this equation to find profit.