Upcoming SlideShare
×

# 07 introduction to linear programming

1,668 views
1,534 views

Published on

Published in: Education, Technology, Business
0 Likes
Statistics
Notes
• Full Name
Comment goes here.

Are you sure you want to Yes No
Your message goes here
• Be the first to comment

• Be the first to like this

Views
Total views
1,668
On SlideShare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
24
0
Likes
0
Embeds 0
No embeds

No notes for slide

### 07 introduction to linear programming

1. 1. Systems of Linear Inequalities and Introduction to Linear Programming<br />
2. 2. Fundamental theorem of linear programming<br />Over the closed convex polygons, the maximum and minimum values of any linear expansion occur at corner points or vertices of the region or at all points along one side.<br />The inequalities that determine the solution region form the set of feasible solutions. <br />Any solution satisfies the constraints or restrictions placed on the variables of the given problem. <br />An optimal feasible solution is any feasible solution which optimizes the subject function under consideration. <br />
3. 3. APPLICATIONS<br />In real situations, x and y often represent quantities or amounts, which cannot be negative.<br />In this case our graphs are restricted to the first quadrant, where x and y are both nonnegative.<br />
4. 4. Example 1:<br />An animal feed is to be a mixture of foodstuffs, each unit of which contains protein, fat, and carbohydrates in the number of grams:<br />Each bag of the resulting mixture is to contain at least 400g of protein, 21g of fat, and at most 1,400g of carbohydrates.<br />Find the mixtures that meet these requirements. If each gram of foodstuff A costs P100 and each gram of foodstuff B costs P200, how much of each foodstuff should be used to get the least cost? <br />
5. 5. Example 1:<br />Solution:<br />Let x be the number of units of foodstuff A<br />Let y be the number of units of foodstuff B<br />The following are the constraints, demands, or restrictions placed on the variables of our problem:<br />Protein: at least 400g<br />100x + 50 y ≥ 400<br />
6. 6. Example 1:<br />Solution:<br />The following are the constraints, demands, or restrictions placed on the variables of our problem:<br />Fats: at least 21g<br />x + 9y ≥ 21<br />Carbohydrates: at most 1,400g<br />100x + 300y ≤ 1400<br />Nonnegativity constraint<br />x ≥ 0<br />y ≥ 0<br />
7. 7. Example 1:<br />Solution:<br />The cost for each combination could be represented by<br />C = 100x + 200y in pesos.<br />Objective: minimize cost, C = 100x +200y.<br />
8. 8. Example 1:<br />Solution:<br />Graph the system of inequalities.<br />100x + 50 y ≥ 400<br />x + 9y ≥ 21<br />100x + 300y ≤ 1400<br />x ≥ 0<br />y ≥ 0<br />
9. 9. Example 1:<br />
10. 10. Example 1:<br />Identify the vertices of the polygonal region.<br />Point A:<br />100x + 50y = 400<br />x + 9y = 21<br />A(3, 2)<br />Point B:<br />100x + 50y = 400<br />100x + 300y = 1400<br />B(2, 4)<br />Point C:<br />100x + 300y = 1400<br />x + 9y = 21<br />C(21/2, 7/6)<br />
11. 11. Example 1:<br />Evaluate the value of C at each vertex to find the minimum cost.<br />C = 100x + 200y (Php)<br />A(3, 2) <br />C = 100(3) + 200(2) C = P700<br />B(2, 4)<br />C = 100(2) + 200(4) <br />C = P1,000<br />C(21/2, 7/6)<br />C = 100(21/2) + 200(7/6) <br />C = P1,283<br />The least cost is P700, that is when 3 units of foodstuff A and 2 units of foodstuff B are taken.<br />
12. 12. Example 2:<br />A plastic toy factory manufactures two types of toy cars – type A and type B. Regular orders require a daily output of at least 40 pieces of type A and 30 pieces of type B. It takes 1.5 man hours to produce a type A car and 2 man hours to produce a type B car . The staff can work no more than 204 man hours per day.<br />A. Represent the given information in the form of inequalities and graph them to show the possible numbers of each type that can be produced each day.<br />B. If the profit on each type A car is P30 and on each type B car is P20, find the number of each type that should be produced to maximize profit granting that all toy cars can be sold. <br />
13. 13. Example 2:<br />A plastic toy factory manufactures two types of toy cars – type A and type B. Regular orders require a daily output of at least 40 pieces of type A and 30 pieces of type B. It takes 1.5 man hours to produce a type A car and 2 man hours to produce a type B car . The staff can work no more than 204 man hours per day.<br />A. Represent the given information in the form of inequalities and graph them to show the possible numbers of each type that can be produced each day.<br />Solution:<br />Let x be the number of type A toy cars produced per day.<br />Let ybe the number of type B toy cars produced per day.<br />
14. 14. Example 2:<br />A plastic toy factory manufactures two types of toy cars – type A and type B. Regular orders require a daily output of at least 40 pieces of type Aand 30 pieces of type B. It takes 1.5 man hours to produce a type A car and 2 man hours to produce a type B car. The staff can work no more than 204 man hours per day.<br />Solution:<br />Let x be the number of type A toy cars produced per day.<br />Let ybe the number of type B toy cars produced per day.<br />Constraints:<br />x ≥ 40<br />y ≥ 30<br />1.5x + 2y ≤ 204 <br />x, y ≥ 0<br />
15. 15. Example 2:<br />Graph the constraints to show the possible numbers of each type that can be produced each day. :<br />x ≥ 40<br />y ≥ 30<br />1.5x + 2y ≤ 204 <br />
16. 16. Example 2:<br />Graph the constraints to show the possible numbers of each type that can be produced each day. :<br />x ≥ 40<br />y ≥ 30<br />1.5x + 2y ≤ 204 <br />
17. 17. Example 2:<br />Identify the vertices of the polygonal region.<br />Point A:<br />x = 40<br />y = 30<br />A(40, 30) <br />Point B:<br />x = 40<br />1.5x + 2y = 204<br />B(40, 72)<br />Point C:<br />y = 30<br />1.5x + 2y = 204<br />C(96, 30)<br />
18. 18. Example 2:<br />B. If the profit on each type A car is P30 and on each type B car is P20, find the number of each type that should be produced to maximize profit granting that all toy cars can be sold. <br />Objective: maximize profit, P<br />P = 30x +20y ( in pesos)<br />Evaluate the value of P at each vertex to find the maximum profit<br />P = 30x + 20y (Php)<br />
19. 19. Example 2:<br />Evaluate the value of P at each vertex to find the maximum profit.<br />P = 30x + 20y (Php)<br />A(40, 30)<br />P= 30(40) + 20(30) <br />P = P1,800<br />B(40, 72)<br />P = 30(40) + 20(72) <br />P = P2,640<br />96 type A and 30 type B toy cars must be produced per day to maximize profit. <br />C(96, 30)<br />P = 30(96) + 20(30) <br />P = P3, 480<br />
20. 20. HOMEWORK #5:<br />On a particular airline flight a passenger is allowed to check a piece of luggage, without additional cost, provided the sum of the 3 dimensions (length, width, height) does not exceed 62 in. Suppose a piece of luggage has a height of 20in., and the length is greater than the width, but not more than twice its width. <br />If the length is x inches and the width I y inches, what is the system of linear inequalities involving x and y?<br />Graph the region of permissible values of x and y.<br />
21. 21. HOMEWORK #5:<br />Suppose, on the flight in #1, that a passenger has 2 pieces of luggage and that she is allowed to check the two pieces without additional cost provided their total dimension do not exceed 106 in. The sum of the 3 dimensions of the larger piece is 58 in. Furthermore, the smaller piece has a height of 12in. And the length greater than the width but not more than 10 in. greater.<br />If the smaller piece of luggage has a length of x inches and a width of y inches, what is the system of linear inequalities involving x and y?<br />Graph the region of permissible values of x and y.<br />
22. 22. HOMEWORK #5:<br />An electronic company manufactures 2 radio models, each on a separate production line. The daily capacity of the first line is 60 radios and that of the second is 75 radios. Each unit of the first model uses 10 pieces of a certain electronic component, whereas each unit of the second model requires 8 pieces of the same component. The maximum daily availability of the special component is 800 pieces. The profit per unit of models 1 and 2 is \$30 and \$20, respectively. Determine the optimum daily production of each model.<br />