The Retired Carpenter An Investigation The Retired Carpenter A retired carpenter decides to set up a small business for himself. Working from his garage,

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

Chapter 5 Linear Inequalities and Linear Programming
NCEA Questions. Question Andy’s confectionery shop sells sweets. Bags of wine gums and jaffas are put together in two different combinations. Small.
Table of Contents Factoring A Difference Of Squares Difference of Squares: A difference of squares is an algebraic expression of the form A 2 – B 2, where.
Dr. Ayham Jaaron First semester 2013/2014 August 2013
The Newest Prime Number An Investigation The Newest Prime Number The newest prime number is If this number was to be written out in full.
Linear Programming Unit 2, Lesson 4 10/13.
B-1 Operations Management Linear Programming Module B.
6. Linear Programming (Graphical Method) Objectives: 1.More than one solution 2.Unbounded feasible region 3.Examples Refs: B&Z 5.2.
B-1 Operations Management Linear Programming Module B.
Eg Al is buying some cows and sheep for his farm. He buys c cows at £120 each He buys s sheep at £200 each. He wants at least 10 animals in total. He wants.
3-5: Linear Programming.
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.
Table of Contents Compound Linear Inequalities: Solving Algebraically Example: Algebraically solve, - 5 < 2x + 3  8. First break the compound inequality.
Graphing Linear Equations From the beginning. All the slides in this presentation are timed. You do not need to click the mouse or press any keys on the.
Warm-Up Find all of the possible solutions to the following:
Graphing Linear Equations
Chapter 12 Section 12.1 The Geometry of Linear Programming.
Decision Making via Linear Programming: A simple introduction Fred Phillips
Linear Programming An Example. Problem The dairy "Fior di Latte" produces two types of cheese: cheese A and B. The dairy company must decide how many.
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.
Linear Programming: A Geometric Approach3 Graphing Systems of Linear Inequalities in Two Variables Linear Programming Problems Graphical Solution of Linear.
Solving Systems of Linear Inequalities
3.5 Linear Programming Warm-up (IN) 1. Solve the system: (5, 2)
Linear Programming. Many mathematical models designed to solve problems in business, biology, and economics involve finding the optimum value (maximum.
Warm-Up Solve each for y. Graphing Inequalities Do you know “Boundary”? Do you know “Half-Plane”?
Linear Optimisation. A video chain has been conducting research for a new outlet. The outlet can stock old classic films only, new releases only, or a.
5. Linear Programming Objectives: 1.Problem formulation 2.Solving an LP problem graphically 3.Bounded regions and corner points Refs: B&Z 5.2.
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
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.
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
A factory produces two types of drink, an ‘energy’ drink and a ‘refresher’ drink. The day’s output is to be planned. Each drink requires syrup, vitamin.
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:
Spring 2015 Mathematics in Management Science Linear Programming Mixture Problems Dolls & Skateboards.
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.
Graphing Linear Equations From the beginning. What is a Linear Equation? A linear equation is an equation whose graph is a LINE. Linear Not Linear.
3.4 Solving equations Simultaneous equations. Snakes on planes or How to describe the geometric relationship between planes.
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.
Graphing Linear inequalities. Practice Graphing.
CDAE Class 15 Oct. 16 Last class: Result of group project 1 3. Linear programming and applications Class Exercise 7 Today: 3. Linear programming.
Goal: Graph a linear equation using a table of values. Eligible Content: A / A
Slide Copyright © 2009 Pearson Education, Inc. 7.6 Linear Programming.
© 2009 Prentice-Hall, Inc. 7 – 1 Decision Science Chapter 3 Linear Programming: Maximization and Minimization.
Graphing Linear Equations
Linear Programming. What is linear programming? Use a system of constraints (inequalities) to find the vertices of the feasible region (overlapping shaded.
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)
Linear Programming: A Geometric Approach3 Graphing Systems of Linear Inequalities in Two Variables Linear Programming Problems Graphical Solution of Linear.
1. What does a need to be if there were infinitely many solutions to the system of equations. y + 2x = 12 2y + 4x = 2a.
Chapter 11 Inequalities and Linear Programming Additional Example 11.1Additional Example 11.1 Additional Example 11.2Additional Example 11.2 Additional.
THE PROBLEM – Method 1 Linear Programming : Introductory Example Let x represent number of litres of energy drink Let y represent number of litres of refresher.
Do Now Draw the graph of: 2x – 4y > 12. Solving a system of Inequalities Consider the system x + y ≥ -1 -2x + y <
LINEARPROGRAMMING 5/23/ :13 AM 5/23/ :13 AM 1.
Linear Programming : Introductory Example
Linear Programming.
Chapter 5 Linear Inequalities and Linear Programming
CHAPTER 6:LINEAR PROGRAMMING
Operations Management Linear Programming Module B
GENERAL MATHS – UNIT TWO
Linear Programming A firm sells bags of sugar in two sizes, 1 kg and 500 g. In one day the factory can process 5000 kg of sugar and pack a maximum of 7000.
GENERAL MATHS – UNIT TWO
3-3 Optimization with Linear Programming
Linear Programming Objectives: Set up a Linear Programming Problem
Aidan LeMay, Zack Ennen, Jakob Stokosa, and Nick Martinez
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Nature does nothing uselessly.
Solutions of Linear Functions
Presentation transcript:

The Retired Carpenter An Investigation

The Retired Carpenter A retired carpenter decides to set up a small business for himself. Working from his garage, he decides to make tables and wardrobes which he then sells to the local furniture shop. He buys wood in packets from the Timber Merchant. In a monthly period he decides to devote a total of 20 days to his business and because of storage problems in his garage he is limited to buying a maximum of 36 packs of wood per month from the Timber Merchant. A table requires 2 packs of wood and 2 days labour. A wardrobe requires 3 packs of wood and 1 days labour. These facts are set out in the table in the next slide.

TableWardrobeTotal available per month Wood2 packs3 packs36 packs of wood Labour2 days1 days20 days

On selling the finished product to the Furniture shop he is guaranteed to make a profit of ₤40 on each Table and ₤48 on each Wardrobe. How many of each should the carpenter make per month so that his monthly profit will be a maximum? TableWardrobeTotal available per month Wood2 packs3 packs36 packs of wood Labour2 days1 days20 days

Solution Let x = number of tables Let y = number of wardrobes Then x 0, y 0, 2x+3y 36, and 2x+y 20 This is the old linear programming type of question and the expected method of solution would be to draw the feasible region and then apply the profit function P= 40x + 48y to each of the corner points (10,0), (0,0) (0,12) and (6,8) of the feasible region ending up with the solution 6 tables and 8 wardrobes produce a profit of ₤626 per month for the carpenter. Pupils will probably try a trial and improvement method instead of the above and this will be fine.