C ons Algebra 1 Name. Solutions Practice Period Linear Programming 1. A school is preparing a trip for 400 students. The company who is providing the transportation has 10 buses of 50 seats each and 8 buses of 40 seats, but only has 9 drivers available. The rental cost for a large bus is $800 and $600 for the small bus. Calculate how many buses of each type should be used for the trip for the least possible cost. 1) Define variables x= large buses ve SCAU buses 2) State/ Write Objective Function 900 x + 00g 3) Write the constraints X<10 y <% (0 50x+ 4oy 240 > Sxtdar 49 8 eS 2-541 Xt+g — 32-3410 5 ys Xd 4) Draw Feasible region ai 7y ah 5) Determine the vertices (corners) ey td o4 fos bl? - G, “oft 2B “4 x-ty 2-36 7 ‘t Xaye4 dx, eee (2,09 rey 144-4Q tO Atay Bxity2HO tal (0,4) 6) Plug all vertices into objective function and state the optimal solution. (4,5) > 90D (4) +E00(S) = FOC (2,0) > §00(@) +600 (0) =6400 D ini (0,9 ~ 800) +600(F) = 54Q0)E— Mininw2. Stitches Inc. can make at most 30 jean jackets and 20 leather jackets in a week. It takes a worker 10 hours to make a jean jacket and 20 hours to make a leather jacket. The total number of hours by all of the employees can be no more than 500 hours per week. The profit on a jean jacket is $20, and the profit on a leather jacket is $50. How many of each type should be produced in order to maximize profit? What is the maximum profit? 1) Define variables x= FR je un jackets ye DF Leathar jockets 2) State/ Write Objective Function 20x%+ By 3) Write the constraints Ox+d04-< 50d” xa X£20 4SQ0 4) Draw Feasible region 5) Determine the vertices (corners) s @,20) C0, 20) (30,9) (3,10) into objective function and I solution. (0,80) —» 40(0)+90(20)) = (000 (10, 30) —? a0(/0) +50 (20) = 1400 & Maximum (30,0) —= 2030) +50(0) = 600 (30,10) > 20(30) + $010) = (1003. A transport company has two types of trucks, Type A and Type B. Type A has a refrigerated capacity of 20 m3 and a non-refrigerated capacity of 40 m? while Type B has the same overall volume with equal sections for refrigerated and non-refrigerated stock. A grocer needs to hire trucks for the transport of 3,000 m3 of refrigerated stock and 4 000 m3 of non-refrigerated stock. The cost per kilometer of a Type A is $30, and $40 for Type B. How many trucks of each type should the grocer rent to achieve the minimum total cost? 1) Define variables x27 TupeA ve? Tupe'R 2) State/ Write Objective Function DetdOn 3) Write the constraints Ww DO« + 2y 23000 7 Av+3y8300 4Ox+ By N4oco> x+34>400 x4 an o | 0 14s 33 (5010 (00 ) ° 4) Draw Feasible region 10 5) Determine the vertices (corners) er (1S, 0) x42 300 ey _ 4-400 (0,132) Ux #8400 ~ax =-|00 (50,67 x25) y26G67 6) Plug all vertices into objective function and state the optimal solution. (150 0\ __ 5 2050+ 40(0) = F500 (0,188 —> 29(0 Vt 40(I0) FE (D7) > sots0) +4067) = FRO Cost