Linear Programming Project. Warm-Up Write an Inequality for the following.

Slides:



Advertisements
Similar presentations
Solving Systems of Linear Equations Graphically and Numerically
Advertisements

3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Linear Programming. Businesses use linear programming to find out how to maximize profit or minimize costs. Most have constraints on what they can use.
3.4 Linear Programming.
Applications of Linear Programming
Linear Programming: The Filing Cabinet Dilemma: Algebra 2 MathScience Innovation Center Betsey Davis.
A 4-H Club member raises only geese (x) and pigs (y).
456/556 Introduction to Operations Research Chapter 3: Introduction to Linear Programming.
1. The Problem 2. Tabulate Data 3. Translate the Constraints 4. The Objective Function 5. Linear Programming Problem 6. Production Schedule 7. No Waste.
S EPTEMBER 14, L INEAR P ROGRAMMING Linear programming = a process of maximizing a linear objective function Objective function = gives a quantity.
Linear Programming?!?! Sec Linear Programming In management science, it is often required to maximize or minimize a linear function called an objective.
Objective 3-4 Linear Programming Solve linear programming problems.
(1/24 and 1/27) Bellwork: 1)List 2 things we’ve discussed this semester 2)What is one positive thing you’d be willing to share?
3.4 Linear Programming.
Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem.
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.
Systems. Day 1 Systems of Linear Equations System of Linear Equations: two or more linear equations together The solution of the system of equations.
Solve linear programming problems. Objective linear programming constraint feasible region objective function Vocabulary.
3.4 Review of Linear Programming
Determine if the given ordered pair is a solution of
Graph and solve systems of linear inequalitites A-CED 3.
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.
Objective Vocabulary Solve linear programming problems.
Solve problems by using linear programming.
Holt Algebra Solving Systems of Linear Inequalities Graph and solve systems of linear inequalities in two variables. Objective system of linear inequalities.
Linear Programming. Many mathematical models designed to solve problems in business, biology, and economics involve finding the optimum value (maximum.
11C. Linear Programming. What is a linear programming problem? 1.A set of variables (in Further Maths there will only ever be two variables) called decision.
Linear Programming Advanced Math Topics Mrs. Mongold.
Class Schedule: Class Announcements Homework Questions 3.4 Notes Begin Homework.
Class Opener: Solve each equation for Y: 1.3x + y = y = 2x 3.x + 2y = 5 4. x – y = x + 3y = x – 5y = -3.
Get out your Vertices Worksheet!
Thinking Mathematically Algebra: Graphs, Functions and Linear Systems 7.5 Linear Programming.
3-6: Linear Programming Linear programming is a process of finding a maximum or minimum of a function by using coordinates of the polygon formed by the.
3-4 Linear Programming (p. 139) Algebra 2 Prentice Hall, 2007.
Constraints Feasible region Bounded/ unbound Vertices
Holt McDougal Algebra Linear Programming Linear programming is method of finding a maximum or minimum value of a function that satisfies a given.
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 Graph the following system of inequalities Y > 3x – 2 5y + 4x < 20.
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.
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.
Math Jeopardy F $100 F $200 E $300 E $400 Abs $500 Abs $100 LF $200 LF $300 LF $400 SP $500 SP $100 LP $200 LP $300 LP $400 LP $500 LP $100 LP $200 LP.
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 Question 1 A local farmer raises pigs and geese. Two constraints: 1.The farmer wants to raise no more than 16 animals. 2.The farmer.
October 18 and 19.
Digital Lesson Linear Programming.
Warm Up Solve each inequality for y. 1. 8x + y < 6
Digital Lesson Linear Programming.
Lesson 4-3 System of Inequalities
Determining the optimal solution to a real-world engineering problem
Linear Programming The Graphical Method Review Problems
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
3.4 Review of Linear Programming
ALGEBRA II HONORS/GIFTED SECTION 3-4 : LINEAR PROGRAMMING
Linear Systems Chapter 3.
3-3 Optimization with Linear Programming
Objective Vocabulary Solve linear programming problems.
Graphing Systems of Linear Inequalities
Warm Up Solve for x:
Linear Programming Example: Maximize x + y x and y are called
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.
Linear Programming.
Presentation transcript:

Linear Programming Project

Warm-Up Write an Inequality for the following

What is it? Linear Programming is a method of finding the maximum or minimum value of a function that satisfies a given set of conditions called constraints. Objective Function Constraints Feasible Region

Example Problem You need to buy some filing cabinets. You know that 3-drawer filing cabinets cost $10 per unit, requires six square feet of floor space, and holds eight cubic feet of files. Also, you know 4-drawer filing cabinets cost $20 per unit, requires eight square feet of floor space, and holds twelve cubic feet of files. You have been given $140 for this purchase, though you don't have to spend that much. The office has room for no more than 72 square feet of cabinets. How many of which model should you buy, in order to maximize storage volume?

Present the Problem We are trying to find the number of each type of cabinet to buy that would give us the maximum storage volume, yet stay within our price range and the amount of room that we have in the office.

Define Your Variables Answers what you are looking for X- will be the number of 3-drawer filing cabinets that you will purchase Y- will be the number of 4-drawer filing cabinets that you will purchase

Write Objective Function What are you trying to maximize or minimize? We are trying to maximize the storage volume 3-drawer filing cabinets hold 8 Cubic Feet 4-drawer filing cabinets holds 12 Cubic Feet

State the Constraints Only $140 to make the purchase Only 72 feet of Floor Space There is nothing to give back. (so cant purchase negative numbers of either type)

Create Inequalities for the Constraints Only $140 to make the purchase 3-drawer filing cabinets cost $10 per unit 4-drawer filing cabinet costs $20 per unit

Create Inequalities for the Constraints (Cont.) Only 72 feet of Floor Space 3-drawer filing cabinets take up 6 square feet on the floor 4-drawer filing cabinets take up 8 square feet on the floor

Create Inequalities for the Constraints (Cont.) There is nothing to give back. (so cant purchase negative numbers of either type)

List of all Constraints/ Convert to Slope-Intercept form Or y < –( 1 / 2 )x + 7 Or y < –( 3 / 4 )x + 9

Graph All Constraints Feasible region (grey) is where they all overlap

Find all Vertices Around Feasible Region (0,7) (12,0) (0,0) (8,3)

Test all Vertices in the Objective Function VertexFunction (8x +12y = V) Volume (0,7) 8(0) +12(7) 84 (0,0) 8(0) + 12 (0) 0 (12, 0) 8(12) + 12(0) 96 (8,3) 8(8)+12(3) 100

Find Maximum/Minimum VertexFunction (8x +12y = V) Volume (0,7) 8(0) +12(7) 84 (0,0) 8(0) + 12 (0) 0 (12, 0) 8(12) + 12(0) 96 (8,3) 8(8)+12(3) 100 Maximum

State a Conclusion to your Problem (8,3) In order to maximize the storage space we have, it would be most beneficial for you to buy 8 3-drawer filing cabinets and 3 4-drawer filing cabinets.