Loading presentation...

Present Remotely

Send the link below via email or IM


Present to your audience

Start remote presentation

  • Invited audience members will follow you as you navigate and present
  • People invited to a presentation do not need a Prezi account
  • This link expires 10 minutes after you close the presentation
  • A maximum of 30 users can follow your presentation
  • Learn more about this feature in our knowledge base article

Do you really want to delete this prezi?

Neither you, nor the coeditors you shared it with will be able to recover it again.


Grade 10 Math: Linear Programming Assignment

No description

Matheesan Thirukumaran

on 6 March 2013

Comments (0)

Please log in to add your comment.

Report abuse

Transcript of Grade 10 Math: Linear Programming Assignment

Linear Programming Assignment By: Matheesan T. 10F2 References Step 1:
Defining the Variables Let x represent the number of dining tables.
Let y represent the number of patio tables.
Let P represent the amount of profit. Step 2:
Create the Objective Function Maximize Profit:
P=300x + 250y Dining Tables Patio Tables Total Profit ($) 300x 250y 300x + 250y Cutting Time Assembly Time Sanding Time Quality Control Panting Time 30 25 300 40 30 300 20 20 180 10 15 120 15 10 120 Step 3:
Constraints 1.300≥40x+30y (Cutting Time)
2.300≥30x+25y (Assembly Time)
3.180≥20x+20y (Sanding Time)
4.120≥10x+15y (Quality Control)
5.120≥15x+10y (Painting Time)
6. x≥0 (Non-negativity)
7. y≥0 (Non-negativity) Step 4:
Finding the x&y intercepts Equation # X-Intercept Y-Intercept 1. 2. 3. 4. 5. 7.5 10 10 12 9 9 12 8 8 12 1. y≤-4/3x+10
5.y≤-3/2x+12 Step 5:
Changing Constraints into Y-intercept form Since the y value is less than or equal, it means that I will have to shade below the graphed lines to find the feasible region. Step 6:
Graphing and Shading the Feasible Region Step 7:
Finding the Corner Points A (0,8) Equation 4
B (3,6) Intersection of Equation 1,3,4
C (7.5,0) Equation 1
O (0,0) Origin 1. 300≥40x+30y
3. (180≥20x+20y)2

360=40x+40y (subtraction)

x=3 1. 300≥40x+30y
4. (120≥10x+15y)4

480=40+60y (subtraction)

x=3 Finding B: Step 8:
Finding the Optimal Values Objective Function-->Maximize Profit:
P=300x + 250y A(0,8)

=$2000 B(3,6)

= $2400 C (7.5,0)

=$2250 O (0,0)

=$0 Step 9:
Stating the Optimal Values The Problem: I run a small table manufacturing company. Our company manufacturers two types of tables, dining and patio. We make $300 profit from each dining table we sell and $250 profit for each patio table we sell.

Each type of table goes through the same five steps; cutting, assembly, sanding, quality control, and painting. It takes 40 minutes to cut out all the pieces for a dining table and 30 minutes for a patio table. The CNC router machine can only be operated for a maximum of 5 hours per day. After the pieces are cut, they are assembled by hand. It takes my workers 30 minutes to assemble a dining table and 25 minutes to assemble a patio table. The maximum amount of time on assembly is 5 hours in a day. Tables are then sanded down to become smooth. It takes 20 minutes for both tables and the maximum time spent sanding in a day is 2hours and 30 minutes. Both tables then go through quality control for 15 minutes. The maximum time for this is 2 hours per day. Lastly, the tables are painted accorded to the request. It takes 15 minutes to paint a dining table and 10 minutes to paint a patio table. Painting has a limit of 2 hours.

What is the optimal amount of each table to gain the largest profit per day assuming that all the tables made are sold? The optimal number of dining tables and patio tables to make the highest profit of $2400 would be 3 and 6 respectively. The Solution: In order for the company to obtain its maximum profit of $2400 per day it must manufacture 3 dining tables and 6 patio tables. Finding the Optimal Values: The information and values used in the problems are from my cousin's company. Links Used:
http://freshaj.com/wp-content/uploads/2011/11/pensive-cartoon-guy.jpg (Minutes) (Minutes) (Minutes) (Minutes) (Minutes)
Full transcript