Warm-Up 3.4 1) Solve the system. 2) Graph the solution.

Slides:



Advertisements
Similar presentations
3.4 Linear Programming 10/31/2008. Optimization: finding the solution that is either a minimum or maximum.
Advertisements

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.
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.
Linear Programming Unit 2, Lesson 4 10/13.
Inequalities Continues
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.
Determine if the given ordered pair is a solution of
3.5 Linear Programming Objectives: Write and graph a set of constraints for a linear-programming problem. Use linear programming.
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.
Objective Vocabulary Solve linear programming problems.
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.
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.
Notes 7.5 – Systems of Inequalities. I. Half-Planes A.) Given the inequality, the line is the boundary, and the half- plane “below” the boundary is the.
Linear Programming Problem. Definition A linear programming problem is the problem of optimizing (maximizing or minimizing) a linear function (a function.
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 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!
Constraints Feasible region Bounded/ unbound Vertices
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-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.
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 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 Linear Programming.
LINEARPROGRAMMING 5/23/ :13 AM 5/23/ :13 AM 1.
Digital Lesson Linear Programming.
Digital Lesson Linear Programming.
Copyright © Cengage Learning. All rights reserved.
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.
Linear Programming Objectives: Set up a Linear Programming Problem
Algebra: Graphs, Functions, and Linear Systems
Objective Vocabulary Solve linear programming problems.
8.4 Linear Programming p
LESSON 6–5 Linear Optimization.
Warm Up Solve for x:
Graphical Solution of Linear Programming Problems
Systems of Inequalities. Linear Programming
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.
Section Linear Programming
1.6 Linear Programming Pg. 30.
Do Now Exercise Solve each linear system
Presentation transcript:

Warm-Up 3.4 1) Solve the system. 2) Graph the solution.

3.4 Linear Programming 3.4 Linear Programming What is linear programming? What is the difference between a bounded and an unbounded region? What information do you need to find the maximum and the minimum?

Optimization He ran a disk clean-up on his computer to optimize his computer’s performance. The greenhouse was the optimum location for the new plants. Optimization: Finding the maximum or minimum value of some quantity.

Linear Programming The process of optimizing a linear objective function subject to a system of linear inequalities called constraints. The graph of the system of constraints is called the feasibility region.

Bounded Region y x

Unbounded Region y x

Optimal Solution of a Linear Programming Problem If an objective function has a maximum or a minimum value, then it must occur at a vertex of the feasible region. The objective function will have both a maximum and a minimum value if the feasible region is bounded.

Find the minimum value and the maximum value of C = 3x +4y Subject to the following constraints. (0,8) (8,0)(0,0) At (0,0): C= 3( ) + 4( ) = At (8,0): C =3( ) + 4( ) = At (0,8): C = 3( ) +4( ) =

Find the minimum value and the maximum value of C = 5x +6y Subject to the following constraints At (0,5): C = 5( ) +6( ) = At (2,3): C = 5( ) +6( ) = At (6,0): C = 5( ) +6( )= (0,5) (2,3) (6,0)

Example 1 *the inequalities contained in the problem are called the constraints Let x = the # of afghans Let y = the # of sweaters 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 on each sweater. *the solution to the set of constraints is called the feasible region

Example 1 *the function to be maximized or minimized is called the objective function Write an objective function for the company’s total profit, P, from the sales of afghans and sweaters. 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 on each sweater. P = 10x+ 12y

What is linear programming? The process of optimizing a linear objective function subject to a system of linear inequalities called constraints. What is the difference between a bounded and an unbounded region? A bounded region it totally enclosed, an unbounded region is not. What information do you need to find the maximum and the minimum? The point of intersection of two lines.

Homework p.166, 9-11, odd, 25-26

Warm-Up 1) Graph the feasible region for the set of constraints below. 2) Identify the vertices of the feasible region.