1. Solve this system and find the product of its solutions. x + y = 7 2x – y =8 2. The feasible region for a set of constraints has vertices (2,0), (8,2)

Slides:



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

30S Applied Math Mr. Knight – Killarney School Slide 1 Unit: Linear Programming Lesson 5: Problem Solving Problem Solving with Linear Programming Learning.
Interconnect throughput modeling. Important network performance metrics Throughput – Point to point (link bandwidth + end host software overheads) – Aggregate.
Linear Systems of Inequalities Math Tech II Everette Keller.
Linear Programming 1.6 (M3) p. 30 Test Friday !!.
Lesson 7.6, page 767 Linear Programming
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.
Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem.
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
Linear Programming A Summary. What??  Linear Programming is an algebraic strategy used to find optimal solutions. –Uses linear inequalities called constraints.
Chapter 12 Section 12.1 The Geometry of Linear Programming.
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.
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.
Solve problems by using linear programming.
Interconnect Performance Modeling. Performance modeling Given an interconnect topology, routing, and other parameters, predict the interconnect performance.
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.
In The Name Of Allah Lab 07 ins. Tahani Aldweesh.
Warm-Up Graph the following system of inequalities. Find the coordinates at each vertices.
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
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. 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.
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:
Linear Programming. Graph the following system of inequalities.
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.
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)
3.4 Linear Programming Solve linear programming problems in two variables using graphical methods.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Warm Up Is (4,2) a solution to the system Y > 3x – 2 5y + 4x < 20.
1 What you will learn  Lots of vocabulary!  How to find the maximum and minimum value of a function given a set of “rules”
Slide Copyright © 2009 Pearson Education, Inc. 7.6 Linear Programming.
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.
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-
3.3 and 3.4 Applications of Linear Models
3.3 Linear Programming.
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
ALGEBRA II HONORS/GIFTED SECTION 3-4 : LINEAR PROGRAMMING
3.2 Linear Programming 3 Credits AS
Warm Up Is (4,2) a solution to the system Y > 3x – 2 5y + 4x < 20.
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
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Warm Up Solve for x:
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.
1.6 Linear Programming Pg. 30.
Linear Programming Mr. Carpenter Alg. 2.
Linear Programming.
Do Now Exercise Solve each linear system
Presentation transcript:

1. Solve this system and find the product of its solutions. x + y = 7 2x – y =8 2. The feasible region for a set of constraints has vertices (2,0), (8,2) and (4,-6). Find the max and min vales for the objective function; S= 2y + x 3. Graph the feasible region for the following constraints and find its vertices. y≤ 1/4x + 5 y≤ -x + 6 y≥ 0 x≥ 0

Lesson 3.5 Linear Programming

 Graph the feasible region for each set of constraints. Then, identify the vertices of the feasible region and find the maximum and minimum values if any for the given objective function. S = 3x - y Constraints: y ≤ -x + 4 y ≤ x + 2 x ≥ 0 y≥ 0

The feasible region for a set of constraints has vertices at (-4,0), (3,3), (6,2) and (4,1). Given this feasible region, find the maximum and minimum values of each objective function. #2 P = 4x – 6y

 A farmer has 10 acres to plant wheat and rye. Each acre of wheat costs $200 to plant and each acre of rye costs $100. He has a total of $1200 to spend in planting. Each acre of wheat will make a $500 profit and each acre of rye will make a profit of $300. How many acres of each should be planted to maximize profit? Corner point Value of Objective Function

 A gold processor has two sources of gold ore. Gold from source A costs $20 per ton to process and gold from source B costs $10 to process. Costs must be kept to less than $80 per day. Each source has limited hours of processing each day. Source A can operate for 6 hours per day and source B can operate for 12 hours. The total hours must be kept under 60 hours. If gold from source A yields 2 oz of gold per ton and gold from source B yields 3 oz per ton, how many tons of ore must be produced each day to maximize the profits? Corner point Value of Objective Function

 Bob builds small and large tool sheds. He only has enough supplies to manufacture 30 total sheds. Each small shed requires 6 hours of time to manufacture and each large shed requires 30 hours. He has no more than 300 hours to work on the sheds. If the small shed makes a profit of $130 and the large shed makes a profit of $250, how many of each type of shed should be build to maximize his profit? Corner point Value of Objective Function

Lesson 3.5 Worksheet 3.5.2