Example 1.  Two students Ann and Carl work x and y hours per week, respectively.  Together they can work at most 40 hours per week.  According to the rules for part timers Ann can work at most 8 hours more that Carl.  But Carl can work at most 6 hours more than Ann.  There is an extra constraint  [Graphics:Images/LinearProgrammingMod_gr_11.gif].  Determine the region  [Graphics:Images/LinearProgrammingMod_gr_12.gif]  for these constraints.
1 (a).  If Ann and Carl earn $15 and $17 per hour, respectively, then find their maximum combined income per week.

Solution 1 (a).

Enter the linear function and the constraints.

[Graphics:../Images/LinearProgrammingMod_gr_13.gif]


[Graphics:../Images/LinearProgrammingMod_gr_14.gif]

 

 

Graph the region  [Graphics:../Images/LinearProgrammingMod_gr_15.gif]  defined by the constraints.

[Graphics:../Images/LinearProgrammingMod_gr_16.gif]

[Graphics:../Images/LinearProgrammingMod_gr_17.gif]

[Graphics:../Images/LinearProgrammingMod_gr_18.gif]

 

 

The solution will occur at one of the vertices of the convex polytope. We now solve for these four points.

[Graphics:../Images/LinearProgrammingMod_gr_19.gif]


[Graphics:../Images/LinearProgrammingMod_gr_20.gif]

 

 

[Graphics:../Images/LinearProgrammingMod_gr_21.gif]


[Graphics:../Images/LinearProgrammingMod_gr_22.gif]

[Graphics:../Images/LinearProgrammingMod_gr_23.gif]

 

 

Graph the level curves of the objective function.

[Graphics:../Images/LinearProgrammingMod_gr_24.gif]


[Graphics:../Images/LinearProgrammingMod_gr_25.gif]

[Graphics:../Images/LinearProgrammingMod_gr_26.gif]

 

 

The solution point for the maximum is the furthest point in the region in the direction of the gradient  [Graphics:../Images/LinearProgrammingMod_gr_27.gif].
Find the gradient vector [Graphics:../Images/LinearProgrammingMod_gr_28.gif].

[Graphics:../Images/LinearProgrammingMod_gr_29.gif]


[Graphics:../Images/LinearProgrammingMod_gr_30.gif]

 

 

[Graphics:../Images/LinearProgrammingMod_gr_31.gif]


[Graphics:../Images/LinearProgrammingMod_gr_32.gif]

[Graphics:../Images/LinearProgrammingMod_gr_33.gif]

 

 

Aside.  We are done!

The related problem of finding the minimum is solved in a similar fashion.  All we need to do is check out the function values at the vertices.

[Graphics:../Images/LinearProgrammingMod_gr_34.gif]



[Graphics:../Images/LinearProgrammingMod_gr_35.gif]

[Graphics:../Images/LinearProgrammingMod_gr_36.gif]

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2005