P. 112. I can solve linear programing problem. Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.

Slides:



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

3.4 Linear Programming.
3.4 Linear Programming 10/31/2008. Optimization: finding the solution that is either a minimum or maximum.
30S Applied Math Mr. Knight – Killarney School Slide 1 Unit: Linear Programming Lesson 5: Problem Solving Problem Solving with Linear Programming Learning.
Linear Programming Vocabulary Linear Programming Objective Function Constraints.
Linear Programming Problem
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.
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.
Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem.
Linear Programming Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Linear programming is a strategy for finding the.
4.3.1 – Systems of Inequalities. Recall, we solved systems of equations What defined a system? How did you find the solutions to the system?
Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities.
Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities.
Systems of Linear Equations and Inequalities (Chapter 3)
Linear Programming. Consider the following problem: A tailor has the following materials available in stock: 16 m 2 of cotton, 11 m 2 of silk and 15 m.
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.
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 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.
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.
Linear Programming Advanced Math Topics Mrs. Mongold.
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 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!
Constraints Feasible region Bounded/ unbound Vertices
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.
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.4 Linear Programming Objective:
3.3 Linear Programming. Vocabulary Constraints: linear inequalities; boundary lines Objective Function: Equation in standard form used to determine the.
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.
Algebra 1 Section 7.6 Solve systems of linear inequalities The solution to a system of linear inequalities in two variable is a set of ordered pairs making.
1 1 Slide Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an.
Linear Programming Chapter 3 Lesson 4 Vocabulary Constraints- Conditions given to variables, often expressed as linear inequalities. Feasible Region-
October 7: Systems of Equations Today you will review how to solve systems of equations by graphing and will learn how to classify the systems. - HW Review.
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.
Solving Systems of Linear Equations and Inequalities by Graphing
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
ALGEBRA II HONORS/GIFTED SECTION 3-4 : LINEAR PROGRAMMING
Linear Systems Chapter 3.
3.2 Linear Programming 3 Credits AS
3-3 Optimization with Linear Programming
Linear Programming.
Linear Programming Objectives: Set up a Linear Programming Problem
3.4 – Linear Programming.
8.4 Linear Programming p
Warm Up Solve for x:
Graphical Solution of Linear Programming Problems
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Linear Programming Problem
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Nature does nothing uselessly.
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Section Linear Programming
1.6 Linear Programming Pg. 30.
Presentation transcript:

p. 112

I can solve linear programing problem.

Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where you optimize an objective function with a system of linear inequalities called constraints. The overlapped shaded region is called the feasible region. Infeasible – when the constraints of a linear programing application do not overlap. Alternate optimal solutions- when there are two or more possible linear programing application (usually the graph is parallel to one side

1. Graph the constraints. 2. Locate the ordered pairs of the vertices of the feasible region. 3. If the feasible region is bounded (or closed), it will have a minimum & a maximum. If the region is unbounded (or open), it will have only one (a minimum OR a maximum). 4. Plug the vertices into the linear equation (C=) to find the min. and/or max.

If the region is unbounded, but has a top on it, there will be a maximum only. If the region is unbounded, but has a bottom, there will be a minimum only.

x  2 x  5 y  0 y  -2x+12 Vertices of feasible region: (2,8) C= -2+3(8)= 22 (2,0) C= -2+3(0)= -2 (5,0) C= -5+3(0)= -5 (5,2) C= -5+3(2)= 1 Max. of 22 at (2,8) Min. of -5 at (5,0)

x0x0 y  2x+2 5  x+y Vertices? (0,2) C=0+5(2)=10 (1,4) C=1+5(4)=21 Maximum only! Max of 21 at (1,4)

Here is a plan of the steps used to solve word problems using linear programming: 1.After reading the question, make a chart to see the information more clearly. 2.Assign variables to the unknowns. 3.Form expressions to represent the restrictions. 4.Graph the inequalities. 5.Find the coordinates of the corner points of the feasible region. 6.Find the vertex point that maximizes or minimizes what we are looking for. 7.State the solution in a sentence. Theory – Solving Problems Using Linear Programming

Example – Seven Steps

Example – Seven Steps cont’d

Example 2 – Seven Steps

Example 2 – Seven Steps cont’d

Groupwork Every table will answer one problem on page 116 to 118. Remember to assign an equipment manager, recorder, presentor and facilitator. Write legibly your answer on a huge graphing paper. Equiptment manager get the materilas (3 colors of markers, Huge graphing paper and ruler.)