Download presentation

1
**Linear Programming - Cabinets**

By Stephanie Scott

2
Problem Your company produces cabinets using two different processes. The number of assembly hours required for each process is listed in the table below. You can use up to 3000 hours of machine time, up to 3600 hours of skilled labor, and up to 3600 hours of unskilled labor. The profit from Process A is $50 per cabinet and the profit from Process B is $70 per cabinet. How many cabinets should you make with each process to obtain a maximum profit? Process A Process B Machine Time Skilled Labor Unskilled Labor

3
Variables Process A = X Process B= Y

4
**Constraints x+2y < 3000 3x+y < 3600 2x+2y < 3600 X > 0**

5
**Objective Function In Process A we make $50 In Process B we make $70**

So the objective function is P=X50+Y70

6
Graph On paper

7
**Max & Min Points (0, 1500), (600, 1200), (900, 900), and (1200,0)**

Plug the points into the objective function P=X50+Y70 P=(o)50+(1500)70, =105000 P=(600)50+(1200)70, =114000, Max P=(900)50+(900)70, = P=(1200)50+(0)70, = 60000, Min

8
Conclusion I learned that in reality that you can use linear programming to answer questions in real life situations such as finding the min or the max on a profit. 600 cabinets in Process A and 1200 cabinets in Process B will make the most money.

Similar presentations

Presentation is loading. Please wait....

OK

Integer Programming Models

Integer Programming Models

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on endangered species in india Download ppt on properties of triangles Ppt on shell scripting pdf 7 segment led display ppt online Ppt on solar system for class 8 free download Ppt on central limit theorem proof Ppt on economic order quantity ppt Respiratory system anatomy and physiology ppt on cells Ppt on festivals of india in hindi Ppt on google file system