Aidan LeMay, Zack Ennen, Jakob Stokosa, and Nick Martinez

Slides:



Advertisements
Similar presentations
Linear Programming Problem
Advertisements

Standard  MM3A6. Students will solve linear programming problems in two variables.  a. Solve systems of inequalities in two variables, showing the solutions.
Warm – up Toya is training for a triathlon and wants to bike and run on the same day. She has less than 3 hours to spend on her workouts. What inequality.
Linear Programming 1.6 (M3) p. 30 Test Friday !!.
(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?
Linear Programming Unit 2, Lesson 4 10/13.
3-5: Linear Programming.
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.
Systems. Day 1 Systems of Linear Equations System of Linear Equations: two or more linear equations together The solution of the system of equations.
Warm Up.
Warm-Up Find all of the possible solutions to the following:
A-REI Represent and solve equations and inequalities graphically
Determine if the given ordered pair is a solution of
Warm - Up. Learning Targets  I can solve systems of inequalities by graphing.  I can determine the coordinates of the vertices of a region formed by.
Check it out! : Solving Linear Inequalities in Two Variables.
Linear Programming Objective: I can solve problems using linear programming.
Additional Practice – back side of worksheet #1 x = $ in 6% y = $ in 12% Objective Function: P =.06x +.12y Constraints:
Operations Management
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.
 A concert promoter wants to book a rock group for a stadium concert. A ticket for admission to the stadium playing field will cost $125, and a ticket.
Opener. Notes: 3.4 Linear Programming Optimization  Many real-life problems involve a process called optimization.  This means finding a maximum or.
Section 4.5 Graphing Systems of Linear Inequalities in Two Variables.
Linear Programming: A Geometric Approach3 Graphing Systems of Linear Inequalities in Two Variables Linear Programming Problems Graphical Solution of Linear.
3.5 Linear Programming Warm-up (IN) 1. Solve the system: (5, 2)
Linear Equations in Two Variables A Linear Equation in Two Variables is any equation that can be written in the form where A and B are not both zero.
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.
CCGPS Coordinate Algebra Day 33 - Notes
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
Linear Programming 1.4 Algebra II.
Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.
Intro to Linear Programming
Section 4.5 Graphing Systems of Linear Inequalities in Two Variables.
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!
Linear Programming. Graph the following system of inequalities.
3-4 Linear Programming (p. 139) Algebra 2 Prentice Hall, 2007.
Chapter 2 Systems of Linear Equations and Inequalities.
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.
Linear Programming.  Linear Programming provides methods for allocating limited resources among competing activities in an optimal way.  Linear → All.
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.
Warm Up Is (4,2) a solution to the system Y > 3x – 2 5y + 4x < 20.
SYSTEMS OF EQUATIONS. Unit 2 Systems of Equations A system of equations is two or more equations with the same variables. ex. 3x-2y=8 4x+3y=12 There are.
Alex’s Furniture Warehouse Linear Programming for a Furniture Company.
Warm – Up 8/29/14 At a fund raiser, you are selling shirts and hats. Shirts cost $10 and hats cost $6. You sell a total of 52 items and make $448.
GENERAL MATHS – UNIT TWO
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.
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.
Systems of Inequalities
Chapter 5 Linear Inequalities and Linear Programming
Digital Lesson Linear Programming.
Chapter 5: Systems Vogler Algebra II.
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
Warm – up Toya is training for a triathlon and wants to bike and run on the same day. She has less than 3 hours to spend on her workouts. What inequality.
9/8/16 In solving a system of equations, when will your answer be “no solution”? Identify the slope and y-intercept: 2
Warm Up Is (4,2) a solution to the system Y > 3x – 2 5y + 4x < 20.
Linear Programming Skill 45.
3-3 Optimization with Linear Programming
Linear Programming Example: Maximize x + y x and y are called
Chapter 7: Systems of Equations and Inequalities; Matrices
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Solutions of Linear Functions
Linear Programming Mr. Carpenter Alg. 2.
Presentation transcript:

Aidan LeMay, Zack Ennen, Jakob Stokosa, and Nick Martinez Wallets Aidan LeMay, Zack Ennen, Jakob Stokosa, and Nick Martinez

Relationship between Defining the Variables and the Problem Situation A student is making two types of wallets out of duct tape. She is going to make a tri-fold wallet and a bi-fold wallet. The tri-fold wallet takes 1 hour to finish and the bi-fold wallet takes ½ hour to finish. Each tri-fold wallet costs $1 to make and each bi-fold wallet cost $0.75 to make. The tri-fold wallet sells for $10 and the bi-fold wallets sell for $8. If the student has at most $24 to purchase materials and no more than 20 hours throughout the week to make wallets, what combination of the ti-fold and bi-fold wallets should she make and sell to maximum profit? X= tri-fold wallet amount Y= bi-fold wallet amount

Relationship between the Problem Situation and the System of Linear Inequalities A student is making two types of wallets out of duct tape. She is going to make a tri-fold wallet and a bi-fold wallet. The tri-fold wallet takes 1 hour to finish and the bi-fold wallet takes ½ hour to finish. Each tri-fold wallet costs $1 to make and each bi-fold wallet cost $0.75 to make. The tri-fold wallet sells for $10 and the bi-fold wallets sell for $8. If the student has at most $24 to purchase materials and no more than 20 hours throughout the week to make wallets, what combination of the ti-fold and bi-fold wallets should she make and sell to maximum profit? Tri-fold: X≥0 Hours: 1 X+1/2Y≤20 Bi-fold:Y≥0 Cost: 1X+.75Y≤24

Optimal Solution To Problem Situation (Maximization Of Profit) Relationship: Satisfies the hours requirement (1X+1/2Y≤20) at 1(12)+1/2(16)≤20 as well as the cost restriction (1X+.75Y≤24) at 1(12)+.75(16)≤24. Explanation: If 12 trifold wallets at $10 and 16 bifold wallets at $8 are sold, then the profit will be $248. This satisfies both requirements, because the hours are about 12 and it will only cost $24. The point (12, 16) is the highest cornerpoint of the feasible region.

Closing The problem required us to calculate the maximum profit for selling duct tape wallets, which cost $1 to make a trifold wallet and $0.75 to make a bifold wallet. The cost restriction was $24. It takes 1 hour to make a trifold and 30 minutes (.5 hours) to make a bifold. Her limit is 20 hours. Finally, the bifold sells for $10, and the trifold for $8. The problem required us to calculate the maximum cost. We found that the coordinate (12, 16), as in 12 trifold and 16 bifold, satisfies the equation because it produces a cost of $24, a time of 12.03 (rounded to 13) hours, and produces a profit of $248