December 4, 2015 Hanging with Harvard 4 L INEAR P ROGRAMMING.

Slides:



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

Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ Linear Programming in two dimensions:
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?!?! Sec Linear Programming In management science, it is often required to maximize or minimize a linear function called an objective.
1 © 2010 Pearson Education, Inc. All rights reserved © 2010 Pearson Education, Inc. All rights reserved Chapter 8 Systems of Equations and Inequalities.
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.
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.
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.
Linear Systems Two or more unknown quantities that are related to each other can be described by a “system of equations”. If the equations are linear,
Linear Programming Objective: I can solve problems using linear programming.
Linear Programming. Many problems involve quantities that must be maximized or minimized. Businesses are interested in maximizing profit. An operation.
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
Graphing Linear Inequalities in Two Variables Chapter 4 – Section 1.
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.
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.
Linear Programming Introduction: Linear programming(LP) is a mathematical optimization technique. By “Optimization” technique we mean a method which attempts.
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.
Linear Programming Advanced Math Topics Mrs. Mongold.
11/20/2015 6:37 AM1 1 LINEAR PROGRAMMING Section 3.4, ©2008.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 7 Algebra: Graphs, Functions, and Linear Systems.
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!
3-4 Linear Programming (p. 139) Algebra 2 Prentice Hall, 2007.
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.
Greater than or equal to Less than or equal to Greater than Less than Warm Up Copy and fill in the chart. SituationInequality Practice more than an hour.
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.
Slide Copyright © 2009 Pearson Education, Inc. 7.6 Linear Programming.
Linear Programming. What is linear programming? Use a system of constraints (inequalities) to find the vertices of the feasible region (overlapping shaded.
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.
Linear Programming: A Geometric Approach3 Graphing Systems of Linear Inequalities in Two Variables Linear Programming Problems Graphical Solution of Linear.
October 18 and 19.
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.
Digital Lesson Linear Programming.
A seminar talk on “SOLVING LINEAR PROGRAMMING PROBLEM BY GRAPHICAL METHOD” By S K Indrajitsingha M.Sc.
Systems of Inequalities
Digital Lesson Linear Programming.
Ch. 3.4 I can solve problems using linear programming
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.
Linear Programming Skill 45.
3-3 Optimization with Linear Programming
Linear Programming Objectives: Set up a Linear Programming Problem
Algebra: Graphs, Functions, and Linear Systems
Objective Vocabulary Solve linear programming problems.
Linear Programming.
Graphical Solution of Linear Programming Problems
Systems of Inequalities. Linear Programming
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.
Presentation transcript:

December 4, 2015 Hanging with Harvard 4 L INEAR P ROGRAMMING

 Linear programming is a method for finding an optimal solution of an objective function (a minimum or maximum value of some quantity) given a set of constraints.  Objective function is a model of the quantity that you want to make as large or as small as possible.  Constraints are the restrictions on the variables of the objective function in a linear programming problem.  Feasible region contains all the values that satisfy the constraints of the objective function. V OCABULARY Linear programming Objective function Constraints Feasible region

Linear Programming was invented by mathematicians during World War II. After the war, the concept was published and was quickly adopted by many large businesses to manage their resources. H ISTORY...  to optimize loading of cargo on ships and planes  to manage other critical resources Many industries use linear programming as a standard tool to allocate a finite set of resources in an optimal way.  airline crew scheduling  shipping or telecommunication networks  oil refining and blending  production and sales

A Linear Programming Model... Suppose the objective function is … Subject to the constraints  Minimize C = 2x + y Graphical Solution:

Objective function… Subject to the constraints: Vertex Principle of Linear Programming Vertex Principle of Linear Programming Solution: x = 2 and y = 3 to minimize C = 7. If there is a maximum or a minimum value of the linear objective function, it occurs at one or more vertices of the feasible region. Minimize C = 2x + y Vertex 18

You are screen-printing T-shirts and sweatshirts to sell at the Polk County Blues Festival and are working with the following constraints.  You have at most 20 hours to make shirts.  You want to spend no more than $600 on supplies.  You want to have at least 50 items to sell. How many T-shirts and how many sweatshirts should you make to maximize your profit? How much is the maximum profit? Blues Festival T-Shirts SOLUTION Let x = number of T-shirts y = number of sweatshirts P = profit T-shirts, x Sweatshirts, y TOTAL Number Minutes Cost ($) PROFIT ($) Organize information in a table.

Write the objective function and constraints. Write the objective function and constraints. Blues Festival T-Shirts Organize information in a table. Objective Function: Maximize P = 6x + 20y subject to :  You want to spend no more than $600 on supplies.  You have at most 20 hours to make shirts.  You want to have at least 50 items to sell. Constraints

Blues Festival T-Shirts Objective Function: Maximize P = 6x + 20y subject to : 10x+30y ≤ 1200 Constraints Step 1 Graph the constraints to form the feasible region. Step 2 Find the coordinates of each vertex. P = 6(50) + 20(0) = 300 A(50, 0) B(25, 25) C(75, 15) D(120, 0) P = 6(25) + 20(25) = 650 P = 6(75) + 20(15) = 750 P = 6(120) + 20(0) = 720 x+3y = 120 Step 3 Evaluate P.

A linear programming problem that uses the graphical solution,  provides linear constraints,  has an objective function,  either maximized or minimized.  expressed as a system of linear inequalities The optimal solution occurs at one or more vertices of the feasible region. Graph the system of inequalities (or constraints) to obtain the feasible region. Finally, evaluate each vertex to obtain the optimal solution.

Questions ?