Linear Programming 1.3 M3. -8-6-4 -2 2 42 68 4 6 -4 -6 -8 -2 8 Warm-Up Graph the system.

Slides:

Advertisements

Similar presentations

Linear Programming. Businesses use linear programming to find out how to maximize profit or minimize costs. Most have constraints on what they can use.

Advertisements

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.

Standard  MM3A6. Students will solve linear programming problems in two variables.  a. Solve systems of inequalities in two variables, showing the solutions.

SOLUTION EXAMPLE 1 Graph a system of two linear inequalities Graph the system of inequalities. y > –x – 2 y  3x + 6 Inequality 1 Inequality 2 Graph both.

Linear Programming?!?! Sec Linear Programming In management science, it is often required to maximize or minimize a linear function called an objective.

Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem.

EXAMPLE 4 Graph a linear inequality in one variables Graph the inequality y  –3. SOLUTION Graph the equation y = –3. The inequality is , so use a solid.

Coordinate Graphing System of Linear Inequalities.

Graph and solve systems of linear inequalitites A-CED 3.

Unit 1 Test Review Answers

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.

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.

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.

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.

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.

3.6 Solving Absolute Value Equations and Inequalities

Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.

Systems of Equations Algebra 1: Unit 7.

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-4 Linear Programming (p. 139) Algebra 2 Prentice Hall, 2007.

Constraints Feasible region Bounded/ unbound Vertices

Linear Programming-Bellwork

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 The Table Method. Objectives and goals Solve linear programming problems using the Table Method.

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.

Prerequisite Skills VOCABULARY CHECK Copy and complete the statement. 2. The graph of a linear inequality in two variables is the set of all points in.

3-4: Linear Programming Objectives: Standards addressed:

3-5: Linear Programming. Learning Target I can solve linear programing problem.

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.

Warm-Up Solve the system by graphing y = x + 2 x = −3 Solve the system by graphing 4x + y = 2 x − y = 3.

Linear Programming Chapter 3 Lesson 4 Vocabulary Constraints- Conditions given to variables, often expressed as linear inequalities. Feasible Region-

2.7 Linear Programming Objectives: Use linear programming procedures to solve applications. Recognize situations where exactly one solution to a linear.

3.3 – Solving Systems of Inequalities by Graphing

Systems of Equations and Inequalities

Do Now Solve the following systems by what is stated: Substitution

Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)

Linear Systems Chapter 3.

Solve a system of linear equation in two variables

Linear Programming Skill 45.

3-3 Optimization with Linear Programming

Math3H – Unit 2 Day 3 Linear Programming

Linear Programming Objectives: Set up a Linear Programming Problem

Algebra: Graphs, Functions, and Linear Systems

3-4 Linear Programming.

3.2 Linear Programming 3 Credits AS

Systems of Inequalities. Linear Programming

Objectives Identify solutions of linear equations in two variables.

5.1 Solving Systems of Equations by Graphing

Copyright © 2014, 2010, 2007 Pearson Education, Inc.

Systems of Equations Solve by Graphing.

LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.

Section Linear Programming

1.6 Linear Programming Pg. 30.

Linear Programming 1.3 M3.

Linear Programming.

Tell whether the ordered pair is a solution of the equation.

Warm-Up Graph the following system of linear inequalities.

Presentation transcript:

Linear Programming 1.3 M3

Warm-Up Graph the system.

Graph the system.

What is Linear Programming? 1. Way to maximize or minimize a linear objective function 2. Has constraint inequalities 3. Solutions (intersections) of the constraints are possible solutions to the objective function (equation)

General Example Concession Stand that Sells Hot Dogs & Hamburgers You have a certain amount of money to buy them. Only so many hot dogs will fit on the grill. (same with hamburgers) You want to know how much of each to buy to give you the Maximum Profit.

You Have 3 Unknowns Hot Dogs (x) Hamburgers (y) Maximum Profit (z) 2 unknowns are graphed on a coordinate plane. 3 unknowns will create a 3 dimensional graph. (x, y, z) x z y

To Solve 1. Graph the Inequalities 2. Identify the solutions (intersections) 3. Substitute the solutions into the objective function (equation) 4. Look for the answer to the problem. (maximum or minimum value)

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

Understanding with Play-doh 1. Place you play-doh on top of your graph. 2. Trim the edges of your play- doh to be constraint equations. 3. The linear programming concept builds a 3D model that has its top base sliced at an angle. The highest vertex is at the maximum value and the lowest vertex is at the minimum value. 4. Identify the maximum vertex and slice the top base at an angle towards your minimum vertex.