Lial3pt1 PDF

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 6

Finite Mathematics and Calculus with Applications

(7th Edition)
by Lial, Greenwell, and Ritchey

Section 3.1- Graphing Linear Inequalities

7. Graph the linear inequality      

The graph is a half-plane bounded by the line       The line


is not part of the graph.

1st graph the line       Two points on the line are  
and  

Now determine which half-plane by selecting a point not on the line


like   Test   in the inequality       That is make
   and    and see if we get a true or false statement.
We get     , a true statement. Therefore the half-plane must
include the point    we want the half-plane going down.
The graph is shown below.
31. Graph the feasible region for the system of inequalities
    
    



1st we can graph the 2 half-planes      and      


They are bounded by the lines      and      
The lines are shown below:

Using the point   we see that      is false for


   and     However,      is true for
   and     So      is the half-plane going
upward it doesn't contain the point  ), and     
is also the half-plane going upward (it contains the point
 ) .

The graph below is the intersection of the 1st 2 half-planes.


The boundary lines are not part of the graph.

The requirement that      and    means that the


feasible points must lie between    and   , inclusive,
and the points must lie on or to the right of the  axis. This
is shown in yellow.

So we have to be in the yellow ribbon region above and


we must be above the 2 lines. This results in the triangular
region shown in green below.

39. Carmella and Walt produce handmade shawls and afghans. They spin
the yarn, dye it, and then weave it. A shawl requires 1 hr of spinning,
1 hr of dyeing, and 1 hr of weaving. An afghan needs 2 hr of
spinning, 1 hr of dyeing, and 4 hr of weaving. Together they spend
at most 8 hr spinning, 6 hr dyeing, and 14 hr weaving.
a) Complete the chart.
Shawls Afghans Total
Number Made  
Spinning Time
Dyeing Time
Weaving Time

b) Set up a system of inequalities and graph the feasible region.


c) Using your graph from part b, can 3 shawls and 2 afghans be
made. Can 4 shawls and 3 afghans be made?

The completed chart is


Shawls Afghans Total
Number Made      (not necessary)
Spinning Time      hours 8 hr max
Dyeing Time      hours 6 hr max
Weaving Time      hours 14 hr max
Since there are only 8 hr for spinning,       Altogether there
are 5 inequalities which must be satisfied:
    
 
    
     

When we graph the feasible region satisfied by these inequalities,


note that the region must lie in the 1st quadrant because   
and    Therefore just concentrate on the 1st 3 inequalities whose
graphs are 3 half-planes bounded by           and
     These 3 boundary lines are shown below.
Using the test point   we see that the 3 inequalities,     
     and      are satisfied by      
Therefore all 3 half-planes open downward and the feasible region
which must be in the 1st quadrant is

3 shawls and 2 afghans can be made because   is a point in


the region.
4 shawls and 3 afghans can not be made because   is not a
point in the region. The points are plotted below.

You might also like