Mr. Barker Discrete math. Linear programming is a tool for maximizing or minimizing a quantity, typically a profit or a cost, subject to constraints.

Slides:



Advertisements
Similar presentations
30S Applied Math Mr. Knight – Killarney School Slide 1 Unit: Linear Programming Lesson 5: Problem Solving Problem Solving with Linear Programming Learning.
Advertisements

1Introduction to Linear ProgrammingLesson 2 Introduction to Linear Programming.
LINEAR PROGRAMMING (LP)
Linear Programming Problem
Session II – Introduction to Linear Programming
Standard  MM3A6. Students will solve linear programming problems in two variables.  a. Solve systems of inequalities in two variables, showing the solutions.
Chapter 5 Linear Inequalities and Linear Programming Section 3 Linear Programming in Two Dimensions: A Geometric Approach.
Chapter 4: Linear Programming Presented by Paul Moore.
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.
Linear and Integer Programming Models
3.4 Linear Programming.
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.
Determine if the given ordered pair is a solution of
Spring 2015 Mathematics in Management Science Mixture Problems What are these? Examples Algebra Review.
Linear Programming Joseph Mark November 3, What is Linear Programming Linear Programming – a management science technique that helps a business.
3.5 Linear Programming Objectives: Write and graph a set of constraints for a linear-programming problem. Use linear programming.
Chapter 4: Linear Programming Lesson Plan
CDAE Class 11 Oct. 3 Last class: Result of Quiz 2 2. Review of economic and business concepts Today: Result of Quiz 2 3. Linear programming and applications.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
Linear Programming. What is Linear Programming? Say you own a 500 square acre farm. On this farm you can grow wheat, barley, corn or some combination.
BUSINESS MATHEMATICS & STATISTICS. LECTURE 45 Planning Production Levels: Linear Programming.
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.
CDAE Class 12 Oct. 5 Last class: Quiz 3 3. Linear programming and applications Today: Result of Quiz 3 3. Linear programming and applications Next.
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
1 Linear Programming (LP) 線性規劃 - George Dantzig, 1947.
CDAE Class 13 Oct. 10 Last class: Result of Quiz 3 3. Linear programming and applications Class exercise 5 Today: 3. Linear programming and applications.
1 A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear constraints. The linear model consists of the.
Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.
Warm-up Solve each system of equations:
Spring 2015 Mathematics in Management Science Linear Programming Mixture Problems Dolls & Skateboards.
Chapter 4: Linear Programming Lesson Plan Mixture Problems  Combining Resources to Maximize Profit Finding the Optimal Production Policy Why the Corner.
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.
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.
Adeyl Khan, Faculty, BBA, NSU 1 Introduction to Linear Programming  A Linear Programming model seeks to maximize or minimize a linear function, subject.
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.
Copyright © 2015 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Section 7.4 Linear Programming Math in Our World.
LINEAR PROGRAMMING A-CED.3 REPRESENT CONSTRAINTS BY EQUATIONS OR INEQUALITIES, AND BY SYSTEMS OF EQUATIONS AND/OR INEQUALITIES, AND INTERPRET SOLUTIONS.
Maximizing the profit of a business
October 18 and 19.
3.3 Linear Programming.
LINEARPROGRAMMING 5/23/ :13 AM 5/23/ :13 AM 1.
Do Now The cost of renting a pool at an aquatic center is either $30 an hr. or $20 an hr. with a $40 non refundable deposit. Use algebra to find for how.
Chapter 4: Linear Programming Lesson Plan
Systems of Equations and Inequalities
Linear programming, absolute values, inequalities
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
9/8/16 In solving a system of equations, when will your answer be “no solution”? Identify the slope and y-intercept: 2
Linear Systems Chapter 3.
Linear Programming Objectives: Set up a Linear Programming Problem
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Warm Up Solve for x:
Linear Programming Example: Maximize x + y x and y are called
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.
Presentation transcript:

Mr. Barker Discrete math

Linear programming is a tool for maximizing or minimizing a quantity, typically a profit or a cost, subject to constraints. It is an example of “New” mathematics. It came about shortly after world war II.

Automobile requires many complicated steps and processes. Using linear programming techniques enables the robots and humans to carry out their tasks faster and more accurately. May also be used in making fuel, drinks, baking bread, etc.

Linear programming is often used to solve special problems known as mixture problems. Mixture problem In a mixture problem, limited resources are combined into products so that the profit from selling those products is a maximum

 Resources: Definite resources are available in limited, known quantities.  Products: Definite products can be made by combining, or mixing, the resources  Recipes: A recipe for each product specifies how many units of each resource are needed to make on unit of that product.  Profits: Each product earns a known profit per unit.  Objective: The objective is to find how much of each product to make so as to maximize profit without exceeding resources

A toy manufacturer can manufacture only skateboards, only dolls, or some mixture of skateboards and dolls. Skateboards require five units of plastic and can be sold for a profit of $1.00, while dolls require two units of plastic and can be sold for a profit of $0.55. If 60 units of plastic are available, what number of skateboards and/or dolls should be manufactured for the company to maximize its profit?

Make a table to sort out all the information. Display the products you want to make, the materials available, and the profit of each product. This is called a mixture chart. Resource(s) Containers of plastic 60 profit Skateboards (x-unit) 5$1.00 Dolls (y-unit) 2$0.55

A clothing manufacturer has 60 yards of cloth available to make shirts and decorated vests. Each shirt requires 3 yards of cloth and provides a profit of $5. Each vest requires 2 yards of cloth and provides a profit of $3. Make a mixture table to show this. Resource(s) Yards of cloth 60 Profit Shirts (x-unit) 3$5 Vests (y-unit) 2$3

Now we need to translate the data into mathematical form to produce constraints Resource(s) Containers of plastic 60 profit Skateboards (x-unit) 5$1.00 Dolls (y-unit) 2$0.55

Write an equation for our clothing manufacturer Resource(s) Yards of cloth 60 Profit Shirts (x-unit) 3$5 Vests (y-unit) 2$3

The feasible set, also called the feasible region, for a linear-programming problem is the collection of all physically possible solution choices that can be made.

Feasible region

Pg ,3, 7-13 odd, 17, 19

Feasible region