Section 5-2 Systems of Linear Inequalities Example 1
|
|  Yüklə 82.5 Kb.
|
| Section 5-2 Systems of Linear Inequalities
Example 1 A patient in a hospital is required to have at least 84 units of drug A and 120 units of drug B each day (assume an overdose of either drug is harmless). Each gram of substance M contains 10 units of drug A and 8 units of drug B. Each gram of substance N contains 2 units of drug A and 4 units of drug B. How many grams of substances M and N can be mixed to meet the minimum daily requirements?
The feasible region is shaded in the graph to the left. The point of intersection is at (4, 22): 
or
Suppose overdoses are potentially harmful and the patient is to receive between 84 and 100 units of drug A and between 120 and 130 units of drug B. How does this change the feasible region.
The feasible region is the dark blue region that lies between the two Drug A constraints (the red lines) and, at the same time, between the two Drug B constraints (the green lines). The vertices of the feasible region are found be finding the intersections of the corresponding lines. Working clockwise from the upper-most vertex: 
Example 2 A manufacturing plant makes two types of inflatable boats; a two-person boat and a four-person boat. Each two-person boat requires 0.9 labor-hours in the cutting department and 0.8 labor-hours in the assembly department. Each four-person boat requires 1.8 labor hours in the cutting department and 1.2 labor-hours in the assembly department. The maximum labor-hours available each month in the cutting department is 864 and in the assembly department is 672. How many of each type of boat can be manufactured under these constraints?
The feasible region is shaded in the graph below. The point of intersection is (480, 240) corresponding to 480 2-person boats and 240 4-person boats: 
 | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
